Search for a Range

最新推荐文章于 2022-01-21 16:09:17 发布

jialuyyy

最新推荐文章于 2022-01-21 16:09:17 发布

阅读量195

点赞数

分类专栏： binary search Array

本文链接：https://blog.csdn.net/jialuyyy/article/details/46480385

版权

Array 同时被 2 个专栏收录

13 篇文章 0 订阅

订阅专栏

binary search

3 篇文章 0 订阅

订阅专栏

Search for a Range

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].

use binary search to search for the ranges.

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