领扣LintCode问题答案-61. 搜索区间
61. 搜索区间
给定一个包含 n 个整数的排序数组,找出给定目标值 target 的起始和结束位置。
如果目标值不在数组中,则返回[-1, -1]
样例 1:
输入:
[]
9
输出:
[-1,-1]
样例 2:
输入:
[5, 7, 7, 8, 8, 10]
8
输出:
[3, 4]
import java.util.Arrays;
public class Solution {
/**
* @param A: an integer sorted array
* @param target: an integer to be inserted
* @return: a list of length 2, [index1, index2]
*/
public int[] searchRange(int[] A, int target) {
// write your code here
int i = Arrays.binarySearch(A, target);
if (i < 0) {
return new int[]{-1, -1};
}
int startIndex = i;
if (A[0] == target) {
startIndex = 0;
} else {
int low = -1;
int high = i - 1;
while (low <= high) {
int mid = (low + high) >>> 1;
int midVal = A[mid];
if (midVal == target) {
startIndex = mid;
high = mid - 1;
} else {
low = mid + 1;
}
}
}
int endIndex = i;
if (A[A.length - 1] == target) {
endIndex = A.length - 1;
} else {
int low = i + 1;
int high = A.length - 1;
while (low <= high) {
int mid = (low + high) >>> 1;
int midVal = A[mid];
if (midVal == target) {
endIndex = mid;
low = mid + 1;
} else {
high = mid - 1;
}
}
}
int[] ret = new int[]{startIndex, endIndex};
return ret;
}
}
鸣谢
非常感谢你愿意花时间阅读本文章,本人水平有限,如果有什么说的不对的地方,请指正。
欢迎各位留言讨论,希望小伙伴们都能每天进步一点点。