二分模板秒杀二分搜索题目

文档阅读

文档阅读

• 情况一
  如果搜索区间[left, right]中一定有目标值索引，那么循环截止条件是while(left < right)
• 情况二
  如果搜索区间[left, right]中不一定有目标值索引，那么循环截止条件是while(left ≤ right)；（一
  般用于搜索区间内是否有某个值）

只要数组有序，就应该想到双指针技巧

• right = arr.length - 1

基本框架

int binarySearch(int[] nums, int target) {
    int left = 0; 
    int right = nums.length - 1; // 注意

    while(left <= right) {
        int mid = left + (right - left) / 2;
        if(nums[mid] == target)
            return mid; 
        else if (nums[mid] < target)
            left = mid + 1; // 注意
        else if (nums[mid] > target)
            right = mid - 1; // 注意
    }
    return -1;
}

寻找左侧边界的二分搜索

public int searchLeft(int[] nums, int target){
    int left = 0, right = nums.length - 1;
    while(left <= right){
        int mid = (left + right) >> 1;
        if(nums[mid] >= target){
            right = mid - 1;
        }else if(nums[mid] < target){
            left = mid + 1;
        }
    }
    if(left == nums.length || nums[left] != target) return -1;
    return left;
}

寻找右侧边界的二分查找

public int searchRight(int[] nums, int target){
    int left = 0, right = nums.length - 1;
    while(left <= right){
        int mid = (left + right) >> 1;
        if(nums[mid] > target){
            right = mid - 1;
        }else if(nums[mid] <= target){
            left = mid + 1;
        }
    }
    if(right == -1 || nums[right] != target) return -1;
    return right;
}

当元素不存在时二分查找

搜索左边界时为例

搜索左边界时target不存在，返回结果解释
target应该插入的nums中的位置，或者说nums中大于等于target的最小元素
索引

public int searchRight(int[] nums, int target){
    int left = 0, right = nums.length - 1;
    while(left <= right){
        int mid = (left + right) >> 1;
        if(nums[mid] >= target){
            right = mid - 1;
        }else if(nums[mid] < target){
            left = mid + 1;
        }
    }
    return left ;
}

题目

34. 在排序数组中查找元素的第一个和最后一个位置

class Solution {
    public int[] searchRange(int[] nums, int target) {
        return new int[]{searchLeft(nums, target), searchRight(nums, target)};
    }

    public int searchLeft(int[] nums, int target){
        int left = 0, right = nums.length - 1;
        while(left <= right){
            int mid = (left + right) >> 1;
            if(nums[mid] >= target){
                right = mid - 1;
            }else if(nums[mid] < target){
                left = mid + 1;
            }
        }
        if(left == nums.length || nums[left] != target) return -1;
        return left;
    }

    public int searchRight(int[] nums, int target){
        int left = 0, right = nums.length - 1;
        while(left <= right){
            int mid = (left + right) >> 1;
            if(nums[mid] > target){
                right = mid - 1;
            }else if(nums[mid] <= target){
                left = mid + 1;
            }
        }
        if(right == -1 || nums[right] != target) return -1;
        return right;
    }
}

704. 二分查找

class Solution {
    public int search(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while(left <= right){
            int mid = (left + right) >> 1;
            if(nums[mid] == target) return mid;
            else if(nums[mid] < target) left = mid + 1;
            else right = mid - 1;
        }
        return -1;
    }
}