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-left)/2;
if(nums[mid]==target)
return mid;
else if(nums[mid]>target){
right=mid-1;
}
else{
left=mid+1;
}
}
return -1;
}
};
LEETCODE 704. 二分查找
最新推荐文章于 2024-06-14 05:45:37 发布