[leetcode] 81. Search in Rotated Sorted Array II
2016-08-19 07:50
435 查看
Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
解法一:
当nuts[mid] == nums[right]的时候,right向左移动一位。其他的和Search in Rotated Sorted Array问题中没有duplicate的代码类似。
class Solution {
public:
bool search(vector<int>& nums, int target) {
if(nums.empty()) return 0;
int left = 0, right = nums.size()-1;
while(left<=right){
int mid = (left+right)/2;
if(target== nums[mid]) return true;
else if(nums[mid]<nums[right]){
if(target>nums[mid] && target<=nums[right]) left = mid +1;
else right = mid -1;
}
else if (nums[mid]>nums[right]){
if(target>=nums[left] && target < nums[mid]) right = mid -1;
else left = mid + 1;
} else --right;
}
return false;
}
};
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
解法一:
当nuts[mid] == nums[right]的时候,right向左移动一位。其他的和Search in Rotated Sorted Array问题中没有duplicate的代码类似。
class Solution {
public:
bool search(vector<int>& nums, int target) {
if(nums.empty()) return 0;
int left = 0, right = nums.size()-1;
while(left<=right){
int mid = (left+right)/2;
if(target== nums[mid]) return true;
else if(nums[mid]<nums[right]){
if(target>nums[mid] && target<=nums[right]) left = mid +1;
else right = mid -1;
}
else if (nums[mid]>nums[right]){
if(target>=nums[left] && target < nums[mid]) right = mid -1;
else left = mid + 1;
} else --right;
}
return false;
}
};
相关文章推荐
- [Leetcode] 81. Search in Rotated Sorted Array II
- LeetCode 81. Search in Rotated Sorted Array II
- [Leetcode 81, Medium] Search in Rotated Sorted Array II
- 【LeetCode】81. Search in Rotated Sorted Array II (2 solutions)
- leetcode 81:Search in Rotated Sorted Array II
- 81. Search in Rotated Sorted Array II Leetcode Python
- 【LEETCODE】81-Search in Rotated Sorted Array II [Python]
- leetcode 81 : Search in Rotated Sorted Array II
- leetCode 81.Search in Rotated Sorted Array II (旋转数组的搜索II) 解题思路和方法
- LeetCode 81 Search in Rotated Sorted Array II
- leetcode[81]Search in Rotated Sorted Array II
- LeetCode(33)(81) Search in Rotated Sorted Array I II
- leetcode_81——Search in Rotated Sorted Array II(二分查找)
- LeetCode81——Search in Rotated Sorted Array II
- [LeetCode]81 Search in Rotated Sorted Array II
- [leetcode] 81.Search in Rotated Sorted Array II
- leetcode || 81、Search in Rotated Sorted Array II
- [leetcode-81]Search in Rotated Sorted Array II(C)
- leetcode 81 :Search in Rotated Sorted Array II
- Leetcode 81. Search in Rotated Sorted Array II