35. 搜索插入位置
思路:二分查找
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int low=0,high=nums.size()-1;
while(low<=high){
int middle = low + (high-low)/2;
if(nums[middle]==target) return middle;
else if (nums[middle]<target) low = middle+1;
else high = middle-1;
}
return low;
}
};