class Solution {
public:
int search(vector<int>& nums, int target) {
int left=0;
int right=nums.size()-1;
int mid=0;
while(left<=right) {
mid=left+((right-left)>>1);
if(nums[mid]==target) return mid;
if(nums[mid]>target) right=mid-1;
else left=mid+1;
}
return -1;
}
};
Leetcode704(力扣704):二分查找
最新推荐文章于 2023-12-07 19:03:45 发布