class Solution {
public:
int search(vector<int>& nums, int target) {
int leftNumber=0;
int rightNumber=nums.size()-1;
while(leftNumber<=rightNumber){
int middleNumber=leftNumber+((rightNumber-leftNumber)/2);
if(nums[middleNumber]==target){
return middleNumber;
}
if(nums[middleNumber]<target){
leftNumber=middleNumber+1;
}
if(nums[middleNumber]>target){
rightNumber=middleNumber-1;
}
}
return -1;
}
};
【DAY9:Leetcode二分查找】
最新推荐文章于 2024-05-31 13:35:03 发布