[LeetCode] Search Insert Position

标签：style   class   blog   code   tar   color   

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) {
        if(A[n-1] < target)
           return n;
        for(int i = 0;i<n;i++){
            if(A[i]>target || A[i]==target)
                return i;
        }//end for
        
    }
};

[LeetCode] Search Insert Position,布布扣,bubuko.com

[LeetCode] Search Insert Position

标签：style   class   blog   code   tar   color   

原文地址：http://www.cnblogs.com/Xylophone/p/3795386.html