LeetCode 35. 搜索插入位置

二分法

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

};