class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left=0;
int right=nums.size()-1;
int middle=right/2;
while(left<=right){
if(nums[middle]>target){
right=middle-1;
}
else if(nums[middle]<target){
left=middle+1;
}
else if(nums[middle]==target){
return middle;
}
middle= (right+left)/2;
}
return left;
}
};
力扣35.搜索插入位置
最新推荐文章于 2024-06-14 05:47:29 发布