法一:暴力O(n)
//暴力
class Solution {
public:
int search(vector<int>& nums, int target) {
int len=nums.size();
for(int i=0;i<len;i++){
if(nums[i]==target) return i;
}
return -1;
}
};
法二:二分O(logn)
//二分
class Solution {
public:
int search(vector<int>& nums, int target) {
int len=nums.size();
int le=0,ri=len-1;
int mid;
while(le<=ri){
mid=(le+ri)/2;
if(target<nums[mid]){
ri=mid-1;
}
else if(target>nums[mid]){
le=mid+1;
}
else return mid;
}
return -1;
}
};