Problem35

class Solution {
    public int searchInsert(int[] nums, int target) {
        //因为有序数组，二分返回的左边界就是要插入的地方
        int l = 0, r = nums.length - 1;
        while(l <= r){
            int m = (l + r) >>> 1;
            if(target == nums[m]){
                return m;
            }else if(nums[m] > target){
                r = m - 1;
            }else{
                l = m + 1;
            }
        }
        return l;
    }

}