[LeetCode]Search Insert Position

来源：互联网发布：一维数组排序算法 php 编辑：程序博客网时间：2024/06/06 22:31

题目：

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

来源：http://oj.leetcode.com/problems/search-insert-position/

思路：

C++ AC代码：

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

运行时间 44ms

其实有一种更简单的解法：

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

运行时间 52ms

0 0