class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0;
int right = nums.size()-1;
while(nums[left] <= nums[right])
{
int middle = (left + right)/2;
if (nums[middle] > target)
{
right = middle-1;
}
else if(nums[middle] < target)
{
left = middle+1;
}
else
return middle;
}
return -1;
}
};
1166
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
