题目来自leetcode:
二分法模板:
1.left小于等于right
2.left更新为middle+1
3.right更新为middle-1
4.返回left
这样最终得到的left比right大1.
class Solution {
public:
int searchInsert(const vector<int>& nums,
题目来自leetcode:
二分法模板:
1.left小于等于right
2.left更新为middle+1
3.right更新为middle-1
4.返回left
这样最终得到的left比right大1.
class Solution {
public:
int searchInsert(const vector<int>& nums,