LeetCode 035 Search Insert Position

标签：

题目要求：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

代码如下：

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        
        int l = distance(A, lower_bound(A, A + n, target));
        return l;
    }
};

LeetCode 035 Search Insert Position

标签：

原文地址：http://www.cnblogs.com/510602159-Yano/p/4279100.html