FindFirstEquals
FindFirstEquals.java 源码
package algorithm.binarysearch;
/**
* @author roseduan
* @time 2019/11/18 22:08
* @description 二分查找变体问题：查找第一个等于给定值
*/
public class FindFirstEquals {
public static void main(String[] args) {
int a = -10 >> 1;
System.out.println(a);
int[] data = {7, 7, 7, 7, 7, 7, 9, 12, 15, 16, 18};
int i = find(data, 7);
System.out.println("i = " + i);
}
private static int find(int[] data, int k){
int low = 0, high = data.length - 1;
while (low <= high){
int mid = low + ((high - low) >> 1);
if (data[mid] > k){
high = mid - 1;
} else if (data[mid] < k){
low = mid + 1;
} else {
if (mid == 0 || data[mid - 1] != data[mid]){
return mid;
} else {
high = mid - 1;
}
}
}
return -1;
}
}
你可能感兴趣的文章
0
赞
热门推荐
-
2、 - 优质文章
-
3、 gate.io
-
8、 golang
-
9、 openharmony
-
10、 Vue中input框自动聚焦