Search for a range_Leetcode_#34

最新推荐文章于 2022-01-13 21:42:50 发布

LittleBob180

最新推荐文章于 2022-01-13 21:42:50 发布

阅读量190

点赞数

分类专栏： Leetcode刷题笔记文章标签： leetcode 算法搜索

本文链接：https://blog.csdn.net/LittleBob180/article/details/52496675

版权

Leetcode刷题笔记专栏收录该内容

63 篇文章 0 订阅

订阅专栏

1 题目
Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm’s runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4]

2 解法

public class Solution {
    public int[] searchRange(int[] nums, int target) {
        int lhs = 0, rhs = nums.length - 1;
        int[] result = new int[]{-1, -1};
        while(lhs < rhs){
            int mid = lhs + (rhs - lhs) / 2;
            if(nums[mid] < target){
                lhs = mid + 1;
            }else{
                rhs = mid;
            }
        }
        // lhs is the first one equal to target.
        if(nums[lhs] != target){
            return result;
        }
        result[0] = lhs;
        rhs = nums.length - 1w
        while(lhs < rhs){
            int mid = lhs + (rhs - lhs) / 2 + 1;
            if(nums[mid] > target){
                rhs = mid - 1;
            }else{
                lhs = mid;
            }
        }
        result[1] = lhs;
        return result;
    }
}