class Solution {
public:
bool search(vector<int>& nums, int target)
{
int low=0;
int high=nums.size()-1;
while(low<=high)
{
int mid=low+(high-low)/2;
if(nums[mid]==target)
return true;
if(nums[low]<nums[mid])
{
if(target>=nums[low] && target<nums[mid])
high=mid-1;
else
low=mid+1;
}
else if(nums[high]>nums[mid])
{
if(target>nums[mid] && target<=nums[high])
low=mid+1;
else
high=mid-1;
}
else if(nums[low]==nums[mid])
low++;
else if(nums[high]==nums[mid])
--high;
}
return false;
}
};
Search in Rotated Sorted Array II
最新推荐文章于 2016-01-26 23:06:02 发布