class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
if (!nums.size()) return 0;
int left = 0, right = nums.size()-1;
while (left <= right)
{
int mid = (left+right)>>1;
if (nums[mid] < target)
left = mid+1;
else
right = mid-1;
}
return left;
}
};