Leetcode 题目解析之 Search Insert Position

原创

ruochen

发布于 2022-01-10 20:05:39

1.2K0

发布于 2022-01-10 20:05:39

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples.

1,3,5,6, 5 → 2

1,3,5,6, 2 → 1

1,3,5,6, 7 → 4

1,3,5,6, 0 → 0

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

原创声明：本文系作者授权腾讯云开发者社区发表，未经许可，不得转载。

如有侵权，请联系 cloudcommunity@tencent.com 删除。

duplicates