TODO:
1. insertion position is always left
2. moving patterns, using concrete examples.
代码:
public class Solution {
public int searchInsert(int[] nums, int target) {
int len=nums.length;
//if(len==0) return 0;
int left=0, right=len-1;
while(left<=right){
int mid= left+(right-left)/2;
if(nums[mid]==target) return mid;
if(target<nums[mid]) right=mid-1;
else left=mid+1;
}
return left;
}
}