leetcode-34 Search Insert Position

題意: 對一內部元素不重複的已排序數列,插入數字

解題思路: 就是二分搜索,原理可見筆者文章

c++ code:

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