【面试题】leetcode34：Find First and Last Position of Element in Sorted Array

最新推荐文章于 2021-08-20 17:37:27 发布

下个路口见_20

最新推荐文章于 2021-08-20 17:37:27 发布

阅读量217

点赞数

分类专栏： JavaSE 算法面试准备刷题文章标签： leetcode Find First and Last Position o

本文链接：https://blog.csdn.net/Somnus_k/article/details/82781376

版权

面试准备同时被 3 个专栏收录

66 篇文章 0 订阅

订阅专栏

JavaSE

54 篇文章 0 订阅

订阅专栏

算法

44 篇文章 0 订阅

订阅专栏

思路：二分查找找到目标值，然后从目标值左右分别进行搜索，如果和目标值相同，则更新下标，否则结束（因为有序）。

public class FindFirstandLastPositionofElementinSortedArray34 {

	public static void main(String[] args) {
		int num[] = { 5, 7, 7, 8, 8, 10 };
		System.out.println(Arrays.toString(searchRange(num, 8)));
		System.out.println(Arrays.toString(searchRange(num, 10)));
		System.out.println(Arrays.toString(searchRange(num, 5)));
		System.out.println(Arrays.toString(searchRange(num, 2)));
	}

	public static int[] searchRange(int[] nums, int target) {

		int mid = search(nums, target);
		int[] t = new int[] { mid, mid };
		if(mid==-1)
			return t;
		int tmp = mid - 1;
		while (tmp >= 0)
			if (nums[tmp] == nums[mid])
				{
				t[0] = tmp;
				tmp--;
				}
			else
				break;
		tmp = mid + 1;
		while (tmp < nums.length)
			if (nums[tmp] == nums[mid])
				{
				t[1] = tmp;
				tmp++;
				}
			else
				break;
		return t;

	}

	private static int search(int[] nums, int target) {

		int low = 0;
		int high = nums.length - 1;
		int mid = 0;
		while (low <= high) {
			mid = (low + high) / 2;
			if (nums[mid] > target)
				high = mid - 1;
			else if (nums[mid] < target)
				low = mid + 1;
			else
				return mid;
		}
		return -1;
	}

}

输出：