题目地址: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 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]
答案借鉴:
https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/discuss/14701/A-very-simple-Java-solution-with-only-one-binary-search-algorithm
import java.util.Arrays;
public class FirstAndLast {
public static int[] searchRange(int[] nums, int target) {
//求最左边容易想到二分查找。
int left = searchEdge(nums, target);
//当查完之后,最大值不等于target的时候,说明没有找到。
if(left ==nums.length || nums[left] !=target){
return new int[]{-1,-1};
}
//利用所求值+1这种方法解决此问题想法很奇特。
return new int[]{left, searchEdge(nums, target + 1) - 1};
}
public static int searchEdge(int[] nums, int target) {
int left =0,right =nums.length;
while (left < right) {
int len = (right+left) >> 1;
if (target > nums[len]) {
left = len + 1;
}
if (target <= nums[len]) {
right = len;
}
}
return left;
}
public static void main(String[] args) {
int[] nums = {1, 3, 5, 5, 5, 5, 5, 9, 9, 10};
// int[] nums = {2, 2, 2};
int[] ints = searchRange(nums, 2);
System.out.println(Arrays.toString(ints));
}
}