目录
Description
- Find First and Last Position of Element in Sorted Array
Given an array of integers nums sorted in ascending order, 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].
Example
-
Example 1:
Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4] -
Example 2:
Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]
题意
找出一增序数组中的target目标值的第一个和最后一个index位置
要求时间复杂度为 O(log n),不存在时返回[-1, -1]
解题思路
这题要求 O(log n)基本就是二分查找,但是要注意跟普通二分查找不太一样,找的是一个区间的left和right。如果能找到的话向左、向右搜索进而找到最小和最大的target,返回index