[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

这道题基本没有什么难度，实在不理解为啥还是Medium难度的，完完全全的应该是Easy啊，三行代码搞定的题，只需要遍历一遍原数组，若当前数字大于或等于目标值，则返回当前坐标，如果遍历结束了，说明目标值比数组中任何一个数都要大，则返回数组长度n即可，代码如下：

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        for (int i = 0; i < n; ++i) {
            if (A[i] >= target) return i;
        }
        return n;
    }
};

[LeetCode] Search Insert Position 搜索插入位置

标签：

原文地址：http://www.cnblogs.com/grandyang/p/4408638.html