二分查找一＞搜索插入位置

public int searchInsert(int[] nums, int target) {
        int left = 0, right = nums.length-1;
        while(left < right) {
            int mid = left+(right-left) / 2;
            if(nums[mid] < target) left = mid+1;
            else right = mid;
        }

        //target在数组外面的第三种情况
        if(nums[left] < target) return left+1;
        return left;
    }