Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
AhkunTa
Arithmetic
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Arithmetic
/
LeetCode
/
81_javascript.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
53 lines (45 loc) · 1.44 KB
master
Breadcrumbs
Arithmetic
/
LeetCode
/
81_javascript.js
Copy path
Top
File metadata and controls
Code
Blame
53 lines (45 loc) · 1.44 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
// 假设按照升序排序的数组在预先未知的某个点上进行了旋转。
// ( 例如,数组 [0,0,1,2,2,5,6] 可能变为 [2,5,6,0,0,1,2] )。
// 编写一个函数来判断给定的目标值是否存在于数组中。若存在返回 true,否则返回 false。
// 示例 1:
// 输入: nums = [2,5,6,0,0,1,2], target = 0
// 输出: true
// 示例 2:
// 输入: nums = [2,5,6,0,0,1,2], target = 3
// 输出: false
// 进阶:
// 这是 搜索旋转排序数组 的延伸题目,本题中的 nums 可能包含重复元素。
// 这会影响到程序的时间复杂度吗?会有怎样的影响,为什么?
/**
* @param {number[]} nums
* @param {number} target
* @return {boolean}
*/
// 和 33 相比增加了重复元素 需要判断
var search = function (nums, target) {
let left = 0;
let right = nums.length - 1;
while (left <= right) {
let middle = Math.floor(left + (right - left) / 2);
if (nums[middle] == target) {
return true;
}
// 当重复数字 不能确定两边相同的区间
if (nums[left] == nums[middle]) {
left++;
} else if (nums[middle] <= nums[right]) {
if (target <= nums[right] && target >= nums[middle]) {
left = middle + 1;
} else {
right = middle - 1;
}
} else {
if (target <= nums[middle] && target >= nums[left]) {
right = middle - 1;
} else {
left = middle + 1;
}
}
}
return false;
};
You can’t perform that action at this time.