Leetcode 33 Search in Rotated Sorted Array 二分查找变式
2016-09-05 15:13
561 查看
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e.,
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
在循环错位的有序数组中找出特定元素。
二分的一个变式,分情况讨论一下,详见注释。
class Solution {
public:
int search(vector<int>& nums, int target)
{
int l=0,r=nums.size()-1;
while(l<=r)
{
int mid=(r+l)/2;
if(nums[mid]==target)
return mid;
if(nums[mid]>=nums[l]) //mid在左侧大一些的区间
{
if(nums[l]<=target && nums[mid]>target) //target比mid小,但大于l,向左移
r=mid-1;
else
l=mid+1;
}
else //mid在右侧小一些的区间
{
if(nums[r]>=target && nums[mid]<target)//target比mid大,但小于r,向右移
l=mid+1;
else
r=mid-1;
}
}
return -1;
}
};
(i.e.,
0 1 2 4 5 6 7might become
4 5 6 7 0 1 2).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
在循环错位的有序数组中找出特定元素。
二分的一个变式,分情况讨论一下,详见注释。
class Solution {
public:
int search(vector<int>& nums, int target)
{
int l=0,r=nums.size()-1;
while(l<=r)
{
int mid=(r+l)/2;
if(nums[mid]==target)
return mid;
if(nums[mid]>=nums[l]) //mid在左侧大一些的区间
{
if(nums[l]<=target && nums[mid]>target) //target比mid小,但大于l,向左移
r=mid-1;
else
l=mid+1;
}
else //mid在右侧小一些的区间
{
if(nums[r]>=target && nums[mid]<target)//target比mid大,但小于r,向右移
l=mid+1;
else
r=mid-1;
}
}
return -1;
}
};
相关文章推荐
- leetcode 33. Search in Rotated Sorted Array 二分查找
- leetcode 33. Search in Rotated Sorted Array(二分查找)
- LeetCode 33 Search in Rotated Sorted Array (二分查找 推荐)
- [LeetCode 33]Search in Rotated Sorted Array (二分查找)
- 二分查找 检查边界条件 Leetcode 33. Search in Rotated Sorted Array
- leetcode 33. Search in Rotated Sorted Array (复杂二分查找)
- leetCode 33.Search in Rotated Sorted Array(排序旋转数组的查找) 解题思路和方法
- LeetCode 33 Search in Rotated Sorted Array 巧用递归二分法查找改造
- leetcode 81. Search in Rotated Sorted Array II-旋转数组|二分查找
- leetcode 二分查找 Search in Rotated Sorted Array
- leetcode_33题——Search in Rotated Sorted Array(二分查找)
- leetcode-33-Search in Rotated Sorted Array 查找
- LeetCode 33 Search in Rotated Sorted Array 二叉查找(三)
- LeetCode------33. Search in Rotated Sorted Array(旋转数组中查找)
- LeetCode 33. Search in Rotated Sorted Array(旋转有序数组,查找目标值Ⅰ)
- leetcode 81. Search in Rotated Sorted Array II 旋转数组查找+二分查找
- LeetCode-Search in Rotated Sorted Array II-在旋转数组中搜索-二分查找
- leetcode 二分查找 Search in Rotated Sorted Array
- LeetCode 33 Search in Rotated Sorted Array 巧用递归二分法查找改造
- leetcode_81——Search in Rotated Sorted Array II(二分查找)