二分专题笔记

二分法

关键点：二段性(绝大多数)

图解：

模板一：寻找绿色线段左端点

伪代码：if M（L 和 R 中点（下取整））落在绿色线段上

​ [L, R] → [L, M], R = M

​ else

​ [L, R] → [M + 1, R], L = M + 1

C++代码模板：

int bsearch_1(int l, int r)
{
    while(l < r){
        int mid = l + r >> 1;
        if(check(mid)) r = mid;
        else l = mid + 1;
    }
    return l;
}

模板二：寻找绿色线段左端点

伪代码：if M（L 和 R 中点（上取整））落在红色线段上

​ [L, R] → [M, R], L= M

​ else

​ [L, R] → [L, M - 1], R = M - 1

C++代码模板：

int bsearch_2(int l, int r)
{
    while(l < r){
        int mid = l + r + 1 >> 1;
        if(check(mid)) l = mid;
        else r = mid - 1;
    }
    return l;
}

上取整原因：当l = r - 1时，再使用下取整会陷入死循环

力扣典型例题：

69.Sqrt(x)

35.Search insert Position

34.Find First and Last Position of Element in Sorted Array

74.Search a 2D Matrix

153.Find Minimum in Rotated Sorted Array

33.Search in Rotated Sorted Array

278.First Bad Version

162.Find Peak Element

287.Find the Duplicate Number

275.H-Index Ⅱ

力扣题目整理：

69.Sqrt(x)

class Solution {
public:
    int mySqrt(int x) {
        int l = 0, r = x;
        while(l < r){
            int mid = l + (long long)r + 1 >> 1;    //错误：溢出，long long防止溢出
            if(mid > x/mid) r = mid - 1;
            else l = mid;
        }
        return l;
    }
};

35.Search insert Position

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int l = 0, r = nums.size() - 1;
        if(nums.empty() || nums.back() < target) return nums.size();    //错误：未进行特殊判定
        while(l < r){
            int mid = (l + r) >> 1;
            if(nums[mid] < target) l = mid + 1;
            else r = mid;
        }
        return l;   //返回大于等于目标值的最左边一个点满足也是不存在数组的情况
    }
};

34.Find First and Last Position of Element in Sorted Array

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        int l = 0, r = nums.size() - 1;
        vector<int>v(2,-1);
        if(nums.empty()) return v;
        //先找左边界
        while(l < r){
            int mid = l + r >> 1;
            if(nums[mid] < target) l = mid + 1;
            else r = mid;
        }
        if(nums[l] != target) return v;
        v[0] = l;
        //再找右边界
        l = 0, r = nums.size() - 1; //错误：忘记重新给l, r赋值
        while(l < r){
            int mid = l + (long long)r + 1 >> 1;
            if(nums[mid] > target) r = mid - 1;
            else l = mid;
        }
        v[1] = r;
        return v;
    }
};

74.Search a 2D Matrix

关键点：获取一维数组下标k在对应二维数组(m, n)的坐标(v, j)，即v = k/n, j =k%n（错误：未能想出）。

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if(matrix.empty() || matrix[0].empty()) return false;
        int m = matrix.size(), n = matrix[0].size();
        int l = 0, r = m * n - 1;
        while(l < r){
            int mid = l + r >> 1;
            if(matrix[mid / n][mid % n] < target) l = mid + 1;
            else r = mid;
        }
        if(matrix[l /n ][l % n] != target) return false;
        else return true;
    }
};

153.Find Minimum in Rotated Sorted Array

二段性：是否小于最后一个点

class Solution {
public:
    int findMin(vector<int>& nums) {
        int l = 0, r = nums.size() - 1;
        while(l < r){
            int mid = l + r >> 1;
            if(nums[mid] > nums.back()) l = mid + 1;
            else r = mid;
        }
        return nums[l];
    }
};

33.Search in Rotated Sorted Array

class Solution {
public:
    int search(vector<int>& nums, int target) {
        //先找最小点下标
        int l = 0, r = nums.size() - 1;
        while(l < r){
            int mid = l + r >> 1;
            if(nums[mid] > nums.back()) l = mid + 1;
            else r = mid;
        }
        int min = l;
        if(nums.back() < target) l = 0, r = min - 1;
        else l = min, r = nums.size() - 1;
        while(l < r){
            int mid = l + r >> 1;
            if(nums[mid] < target) l = mid + 1;
            else r = mid;
        }
        if(nums[l] != target) return -1;
        else return l;
    }
};

278.First Bad Version

// The API isBadVersion is defined for you.
// bool isBadVersion(int version);

class Solution {
public:
    int firstBadVersion(int n) {
        int l = 1, r = n;
        while(l < r){
            int mid = l + (r - l >> 1); //错误：未注意溢出问题，l + r可能存在溢出，转成long long 类型也可以
            if(!isBadVersion(mid)) l =mid + 1;
            else r = mid;
        }
        return l;
    }
};

162.Find Peak Element

不满足二段性，但仍可以用二分法

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        int l = 0, r = nums.size() - 1;
        while(l < r){
            int mid = l + r >> 1;
            if(nums[mid] < nums[mid + 1]) l = mid + 1;
            else r = mid;
        }
        return l;
    }
};

287.Find the Duplicate Number

关键点：抽屉原理，使用二分法时间复杂度O(nlongn)。

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
        int n = nums.size() - 1;
        int l = 1, r = n;
        while(l < r){
            int mid = l + r >> 1;
            int cnt = 0;    //苹果个数(记得初始化)
            for(auto x: nums)	//遍历数组
                if(x >= l && x <= mid)
                    cnt++;
            if(cnt > mid - l + 1) r = mid;  //判断苹果个数是否大于抽屉个数
            else l = mid + 1;
        }
        return l;
    }
};

275.H-Index Ⅱ

class Solution {
public:
    int hIndex(vector<int>& citations) {
        if(citations.back() == 0) return 0;
        int n = citations.size() - 1;
        int l = 0, r = n;
        while(l < r){
            int mid = l + r >> 1;
            if(citations[mid] < citations.size() - mid) l = mid + 1;	//找到右半段左端点应该用模板一，注意理清思路
            else r = mid;
        }
        return citations.size() - l;	
    }
};