class Solution {
public:
int search(vector<int>& nums, int target) {
//二分查找
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{
right = mid-1;
}
}
return -1;
}
};
04-06
458
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交