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

最新推荐文章于 2024-01-09 20:11:45 发布

阿成的春天和我的太阳

最新推荐文章于 2024-01-09 20:11:45 发布

阅读量81

点赞数

本文链接：https://blog.csdn.net/weixin_40602200/article/details/103962581

版权

LeetCode 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

**
 * @Classname Solution1
 * @Description
 * @Date 2020/1/13 16:58
 * @Author SonnSei
 */
public class Solution {
    public int[] searchRange(int[] nums, int target) {
        int[] ret = {-1, -1};
        if (nums == null || nums.length == 0) return ret;
        int left = binarySearch(nums, target);
        // left是可能等于nums.lengt的
        if (left >= nums.length || nums[left] != target) return ret;
        int right = binarySearch(nums, target + 1);
        ret[0] = left;
        ret[1] = right - 1;
        // 也可以这么写
//        right = binarySearchR(nums, right);
//        ret[0] = left;
//        ret[1] = right;
        return ret;
    }

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