leetcode: Search Insert Position

标签：style   blog   class   code   java   tar   

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 i;
        for(i=0;i<n;i++) {
            if(A[i]>=target) {

                break;
            }
        }
        return i;
    }
};

leetcode: Search Insert Position,布布扣,bubuko.com

leetcode: Search Insert Position

标签：style   blog   class   code   java   tar   

原文地址：http://www.cnblogs.com/parapax/p/3703680.html