LeetCode之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

二分查找的应用和STL中lower_bound()函数的功能一样。

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        int first=0,len=n,half,mid;
        while(len>0){
            half=len>>1;
            mid=first+half;
            if(A[mid]<target){
                first=mid+1;
                len=len-half-1;
            }
            else
                len=half;
        }//while
        return first;
    }
};

LeetCode之Search Insert Position,布布扣,bubuko.com

LeetCode之Search Insert Position

原文：http://blog.csdn.net/smileteo/article/details/22198615