LeetCode 35. Search Insert Position 时间复杂度（O(log(n))）

时间复杂度（O(log(n))）,思想，二分查找

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int start = 0;
        int end = nums.size()-1;
        while(start<=end)
            if(nums[(start+end)/2]==target)return (start+end)/2;
            else if(nums[(start+end)/2]>target)    end = (start+end)/2-1;
            else start = (start+end)/2+1;
        return start;
    }
};class Solutio