34 Search for a Range
Last updated
Was this helpful?
Last updated
Was this helpful?
Given an array of integers 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(logn).
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]
.
(1) Binary Search
分别找左边界和右边界
Binary Search: 时间复杂度O(logn), 空间复杂度O(1)