搜索插入位置(leetcode35)

    public static int searchInsert(int[] nums, int target) {

        int len = nums.length;
        if (nums[0] > target) {
            return 0;
        }
        if (nums[len - 1] < target) {
            return len;
        }
        int i;
        for (i = 0; i < len; i++) {
            if (nums[i] >= target) {
                break;
            }
        }
        return i;
    }

    //二分法
    public static int searchInsert1(int[] nums, int target) {

        int len = nums.length;
        int left = 0, right = len, ans = len;
        while (left < right) {
            int mid = (right + left) >> 1;
            if (nums[mid] >= target) {
                ans = mid;
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }

        return ans;
    }