34 Find First and Last Position of Element in Sorted Array

最新推荐文章于 2024-09-30 23:49:04 发布

李说

最新推荐文章于 2024-09-30 23:49:04 发布

阅读量83

点赞数

分类专栏： leetcode 文章标签： leetcode binary search

本文链接：https://blog.csdn.net/weixin_44476534/article/details/86262627

版权

leetcode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

class Solution {
    public int[] searchRange(int[] nums, int target) {
        int[] res = new int[]{-1, -1};
        if (nums == null || nums.length == 0) {
            return res;
        }
        int left = 0;
        int right = nums.length - 1;
        while (left + 1 < right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] <= target) {
                left = mid;
            } else {
                right = mid;
            }
        }
        if (nums[right] == target) {
            res[1] = right;
        } else if (nums[left] == target) {
            res[1] = left;
        }
        left = 0;
        right = nums.length - 1;
        while (left + 1 < right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] >= target) {
                right = mid;
            } else {
                left = mid;
            }
        }
        if (nums[left] == target) {
            res[0] = left;
        } else if (nums[right] == target) {
            res[0] = right;
        }
        return res;
    }
}