Search Insert Position
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int n = nums.size();
int left = 0, right = n-1;
while(left <= right){
int middle = (right+left) /2;
if(nums[middle]<target) left = ++middle;
else right = --middle;
}
return left;
}
};
public:
int searchInsert(vector<int>& nums, int target) {
int n = nums.size();
int left = 0, right = n-1;
while(left <= right){
int middle = (right+left) /2;
if(nums[middle]<target) left = ++middle;
else right = --middle;
}
return left;
}
};
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章