LeetCode 81. Search in Rotated Sorted Array II
2016-12-19 15:14
369 查看
描述
在循环数组中，查找是否存在目标值解决
二分查找class Solution {
public:
bool search(vector<int>& nums, int target) {
int length = nums.size();
int l = 0, r = length - 1;
while (l < r)
{
int m = l + ((r - l) >> 1);
// cout << nums[m] << endl;
if (nums[m] == target)
return true;
if (nums[l] < nums[m])
{
if (nums[l] <= target && target < nums[m])
return binary_search(&nums[l], &nums[m], target);
else
l = m;
}
else if (nums[l] > nums[m])
{
if (nums[r] >= target && target > nums[m])
return binary_search(&nums[m] + 1, &nums[r] + 1, target);
else
r = m - 1;
}
else
++l;
}
if (nums[l] == target)
return true;
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