leetcode: Search Insert Position

时间:2014-05-02 09:54:11   收藏:0   阅读:269

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

bubuko.com,布布扣
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;
    }
};
bubuko.com,布布扣

 

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

评论(0
© 2014 mamicode.com 版权所有 京ICP备13008772号-2  联系我们:gaon5@hotmail.com
迷上了代码!