[容易]搜索插入位置

题目来源：http://www.lintcode.com/zh-cn/problem/search-insert-position/

C++版 VS2012测试通过

//#include <iostream>
//#include <vector>
//using namespace std;

class Solution {
    /** 
     * param A : an integer sorted array
     * param target :  an integer to be inserted
     * return : an integer
     */
public:
    int searchInsert(vector<int> &A, int target) {
        // write your code here
        // find first position >= target
        if (A.size() == 0) {
            return 0;
        }     
        int start = 0, end = A.size() - 1;
        while (start + 1 < end) {
            int mid = (end - start) / 2 + start;
            if (A[mid] >= target) {
                end = mid;
            } else {
                start = mid;
            }
        }     
        if (A[start] >= target) {
            return start;
        }
        if (A[end] >= target) {
            return end;
        }       
        return A.size();
    }
};

//测试
//int main()
//{
//    Solution s;
//
//    int a[]={0,3,5,6};
//    vector<int> v(a,a+4);
//
//    int result=s.searchInsert(v,7);
//    cout<<result;
//}

Python2.7版 spider测试通过

class Solution:
    """
    @param A : a list of integers
    @param target : an integer to be inserted
    @return : an integer
    """
    def searchInsert(self, A, target):
        if len(A) == 0:
            return 0
        start, end = 0, len(A) - 1
        # first position >= target
        while start + 1 < end:
            mid = (start + end) / 2
            if A[mid] >= target:
                end = mid
            else:
                start = mid

        if A[start] >= target:
            return start
        if A[end] >= target:
            return end
        return len(A)

#测试
#if __name__=="__main__":
#     s=Solution()
#     L=[1,3,5,6]
#     print s.searchInsert(L, 2)