【LeetCode】【数组和字符串】搜索插入位置

class Solution {
    public int searchInsert(int[] nums, int target) {
        int index = 0;

        if (nums[0] > target) {
            index = 0;
        }
        if (nums[nums.length - 1] < target) {
            index = nums.length;
        }

        for (int i = 0; i < nums.length - 1; i++) {

            if (nums[i] == target) {
                index = i;
            }

            if (nums[i] < target && nums[i + 1] > target) {
                index = i + 1;
            }
        }
        
        if (nums[nums.length - 1] == target) {
            return nums.length - 1;
        }

        return index;
    }
}

更新解法，参考https://blog.csdn.net/wzs535131/article/details/95003490

class Solution {
    public int searchInsert(int[] nums, int target) {
        int i;
        for (i = 0; i < nums.length; i++) {
            if (nums[i] == target || nums[i] > target)
                return i;

        }
        return i;
    }
}