[Leetcode] Search Insert Position

最新推荐文章于 2019-02-13 15:00:16 发布

原创最新推荐文章于 2019-02-13 15:00:16 发布 · 252 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

67 篇文章

订阅专栏

本文介绍如何使用C++解决搜索插入位置的问题，通过遍历数组并比较目标值与数组元素，找到目标值应该插入的位置。适用于无重复元素的已排序数组。

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

» Solve this problem

简单题

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        for(int i = 0; i<n; i ++)
        {
            if (A[i] >= target)
            {
                return i;
            }
        }
        
        return n;
    }
};