LeetCode每日一题：search insert position

问题描述

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

问题分析

这题太容易了，题目已经给出了已排序的数组，只需要返回第一个不小于target的A[index]即可。

代码实现

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