35. Search Insert Position

刷
June-21-2019

。。和上一题一样，一样在记录比解题用时间长。

    public int searchInsert(int[] nums, int target) {
        if (nums.length == 0) return 0;
        
        int l = 0, r = nums.length - 1;
        while (l <= r) {
            int m = l + (r - l) / 2;
            if (nums[m] >= target) {
                r = m - 1;
            } else {
                l = m + 1;
            }
        }
        
        return l;
    }

转载于:https://www.cnblogs.com/reboot329/p/11068269.html