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

“从0开始做LeetCode”之第九题

 
tag：二分查找——左右边界

难度：medium

给定一个按照升序排列的整数数组 nums，和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。

你的算法时间复杂度必须是 O(log n) 级别。

如果数组中不存在目标值，返回 [-1, -1]。

示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: [3,4]

示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: [-1,-1]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

Note：这道题在二分算法中太经典了，对于lower_bound和upper_bound进行了实现。

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
       int left = left_bound(nums, target);
       int right = right_bound(nums, target);
       return vector<int> {left, right};
    }

    int left_bound(vector<int>& nums, int target){
        int left = 0, right = nums.size()-1;
        //int mid = left + (left + right)/2;
        while(left <= right){
            int mid = left + (right - left)/2;
            if(nums[mid]<target){
                left = mid + 1;
            }else if(nums[mid]>target){
                right = mid - 1;
            }else if(nums[mid]==target){
                right = mid - 1;
            }
        }
        if(left>=nums.size() || nums[left]!=target){
            return -1;
        }
        return left;
    }

    int right_bound(vector<int>& nums, int target){
       int left = 0, right = nums.size()-1;
       //int mid = left + (left+right)/2;
       while(left<=right){
            int mid = left + (right - left)/2;
            if(nums[mid]<target){
                left = mid + 1;
            }else if(nums[mid]>target){
                right = mid - 1;
            }else if(nums[mid]==target){
                left = mid + 1;
            }
        }
        if(right<0 || nums[right]!=target){
            return -1;
        }
        return right;
    }
};

Note：这里给出二分问题的通解，采用左闭右闭方便记忆。

int binary_search(int[] nums, int target) {
    int left = 0, right = nums.length - 1; 
    while(left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1; 
        } else if(nums[mid] == target) {
            // 直接返回
            return mid;
        }
    }
    // 直接返回
    return -1;
}

int left_bound(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1;
        } else if (nums[mid] == target) {
            // 别返回，锁定左侧边界
            right = mid - 1;
        }
    }
    // 最后要检查 left 越界的情况
    if (left >= nums.length || nums[left] != target)
        return -1;
    return left;
}


int right_bound(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1;
        } else if (nums[mid] == target) {
            // 别返回，锁定右侧边界
            left = mid + 1;
        }
    }
    // 最后要检查 right 越界的情况
    if (right < 0 || nums[right] != target)
        return -1;
    return right;
}