[LeetCode] 81. Search in Rotated Sorted Array II
2016-08-03 13:07
507 查看
思路:
因为有重复的, 所以如果nums[left]和nums[mid]相等的时候, 我们就得让left一格一格的向后跳找其中可能夹着的大数(target). 其余的可以参考http://blog.csdn.net/hiimdaosui/article/details/51966558.
因为有重复的, 所以如果nums[left]和nums[mid]相等的时候, 我们就得让left一格一格的向后跳找其中可能夹着的大数(target). 其余的可以参考http://blog.csdn.net/hiimdaosui/article/details/51966558.
bool search(vector<int>& nums, int target) {
int left = 0, right = nums.size() - 1;
while (left <= right) {
int mid = (left + right) >> 1;
if (nums[mid] == target)
return true;
if (nums[left] < nums[mid]) {
if (nums[left] <= target && target < nums[mid])
right = mid - 1;
else
left = mid + 1;
}
else if (nums[mid] < nums[left]) {
if (nums[mid] < target && target <= nums[right])
left = mid + 1;
else
right = mid - 1;
}
else left++;
}
return false;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解