解题思路: 二分法
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int index1 = 0;
int index2 = nums.size();
int mid = 0;
while(index1 < index2){
mid = (index1 + index2)/2;
if(nums[mid] >= target)
index2 = mid;
else
index1 = mid + 1;
}
return index1;
}
};