LeetCode Search for a Range

最新推荐文章于 2024-10-16 18:20:22 发布

lscHacker

最新推荐文章于 2024-10-16 18:20:22 发布

阅读量207

点赞数

分类专栏：算法/oj 文章标签： java leetcode binary search

本文链接：https://blog.csdn.net/miss_snow_m/article/details/46638817

版权

算法/oj 专栏收录该内容

253 篇文章 0 订阅

订阅专栏

Description:

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

Solution:

Binary search.

We use a binary search to find the largest number that is smaller than target and the smallest number that is larger than target. Pay attention to the return number, especially the boundary condition.

public class Solution {
	public int[] searchRange(int[] nums, int target) {
		int maxSmaller = getMaxSmaller(nums, target);
		int minBigger = getMinBigger(nums, target);

		System.out.println(maxSmaller + "  " + minBigger);
		return new int[] { maxSmaller, minBigger };
	}

	int getMaxSmaller(int[] nums, int target) {
		int l = 0, r = nums.length - 1, mid;
		while (l + 1 < r) {
			mid = (l + r) / 2;
			if (nums[mid] >= target)
				r = mid;
			else
				l = mid;
		}
		if (nums[l] == target)
			return l;
		if (l < nums.length - 1 && nums[l + 1] == target)
			return l + 1;
		return -1;
	}

	int getMinBigger(int[] nums, int target) {
		int l = 0, r = nums.length - 1, mid;
		while (l + 1 < r) {
			mid = (l + r) / 2;
			if (nums[mid] <= target)
				l = mid;
			else
				r = mid;
		}
		if (nums[r] == target)
			return r;
		if (r > 0 && nums[r - 1] == target)
			return r - 1;
		return -1;
	}
}