leetcode 35. Search insert location

35. Search insert location

Thought analysis ：
Dichotomous template question .

AC Code ：

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