力扣的格式有点搞不懂,暂时还是先不刷了,随手记一下代码吧
二分模板题
class Solution{
public:
int search(vector<int>& nums, int target){
int mid, lef = 0, rig = nums.size() - 1;
while(lef <= rig){
mid = lef + rig >> 1;
if(nums[mid] == target) return mid;
if(target < nums[mid]) rig = mid - 1;
else lef = mid + 1;
}
return -1;
}
};