解题思路:
二分查找
注意的地方是区间的开闭问题,控制边界条件
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int size = nums.size();
int left = 0, right = size-1, mid = 0;
while(left<=right)
{
mid = (left + right)/2;//或者mid = left + (right - left)/2;
if(nums[mid] > target){
right = mid - 1;
}
else if(nums[mid] < target){
left = mid + 1;
}
else if(nums[mid] == target){
return mid;
}
}
return right + 1;
}
};