class Solution {
public:
int search(vector<int>& nums, int target) {
if(nums[nums.size()-1]<target||nums[0]>target)
return -1;
int left = 0;
int right = nums.size()-1;
while(left<=right){
int mid= (left+right)/2;
if(nums[mid]==target) return mid;
else if(nums[mid]<target) left=mid+1;
else if(nums[mid]>target) right=mid-1;
}
return -1;
}
};
直接遍历就通过了
class Solution {
public:
int search(vector<int>& nums, int target) {
if(nums[nums.size()-1]<target||nums[0]>target)
return -1;
int left = 0;
int right = nums.size();
for(int i=0;i<right;i++){
if(nums[i]==target) return i;
}
return -1;
}
};