class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left = 0, right = nums.size()-1;
int c=left;
while(left < right)
{
int mid = (left+right) / 2;
if (nums[mid] == target)
return mid;
if (nums[mid] < target)
left = mid + 1;
else
right = mid - 1;
c=left;
}
if(nums[c]>=target)
return c;
else
return c+1;
}
};
二分法作业一