版权声明:只要梦想一天,只要梦想存在一天,就可以改变自己的处境。 https://blog.csdn.net/dongyanwen6036/article/details/85523947
35. 搜索插入位置
考察的就是二分查找。
leetcode Ac 99.78%:
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int low=0,high=nums.size()-1;
while (low <= high)
{
int mid = (low + high) / 2;
if (nums[mid] == target)return mid;
else if (nums[mid] < target)low = mid + 1;
else high = mid - 1;
}
return low;
}
};
278. 第一个错误的版本
leetcode Ac 100%:
// Forward declaration of isBadVersion API.
bool isBadVersion(int version);
class Solution {
public:
int firstBadVersion(int n) {
int low = 1, high = n;
while (low < high)
{
int mid = low + (high-low)/ 2;//不能写成mid=(low+high)/2
if (isBadVersion(mid)) high = mid;
else low = mid + 1;
}
return low;
}
};