二分查找 class Solution { public: int searchInsert(vector<int>& nums, int target) { int l=0,r=nums.size(); //target有可能大于所有数 while(l<r){ int mid=l+r>>1; if(nums[mid]<target)l=mid+1; else r=mid; } return r; } }; //二分