35. 搜索插入位置-7月17日

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int left = 0;
        int right = nums.size()-1;
        if(right<0)return 0;
        int mid;
        while(left<=right){//当left==right时还没有满足条件的会跳出循环
            mid = (left+right)/2;
            if(nums[mid]<target){
                left=mid+1;
            }else if(nums[mid]>target){
                right=mid-1;
            }else{
                return mid;
            }
        }

        if(nums[mid]>=target)return mid;
        else return mid + 1;
        
    }
};

//二分法
//本题要找的是target<=nums[i]的min i
//二分法通用模板！！！！
/**
left = 0;right = n-1;
    while(left<=right){//当left==right时还没有满足条件的会跳出循环
        mid = (left+right)/2;
        if(nums[mid]<target){
            left=mid+1;
        }else if(nums[mid]>target){
            right=mid-1;
        }else{
            return mid;
        }
        }
*/