Repository navigation
Expand file tree
/
Copy pathfindnumberinaraay.java
More file actions
54 lines (49 loc) · 1.75 KB
/
Copy pathfindnumberinaraay.java
File metadata and controls
54 lines (49 loc) · 1.75 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
package swordToOffer;
public class findnumberinaraay {
public static void main(String[] args) {
int[] number = new int[]{3,3,3,3,4,5};
findnumberinaraay find = new findnumberinaraay();
int result = find.GetNumberOfK(number, 3);
System.out.println(result);
}
public int GetNumberOfK(int [] array , int k) {
if(array == null || array.length == 0) return 0;
int down= erfensortdown(array, 0, array.length - 1, k);
int up = erfensortup(array, 0, array.length - 1, k);
int result = up - down;
if(down == -1 || up == -1) return 0;
return result + 1;
}
public int erfensortdown(int[] array, int down, int up, int target) {
while(down < up) {
int mid = (down + up) >> 1;
if(array[mid] > target){
up = mid ;
} else if(array[mid] < target) {
down = mid + 1;
} else if(array[mid] == target){
if(mid == 0) return 0;
else if(array[mid - 1] != target) return mid;
else up = mid - 1;
}
}
if(array[down] != target) return -1;
return down;
}
public int erfensortup(int[] array, int down, int up, int target) {
while(down < up) {
int mid = (down + up) >> 1;
if(array[mid] < target){
down = mid + 1;
} else if(array[mid] > target){
up = mid ;
} else if(array[mid] == target){
if(mid == array.length - 1) return array.length - 1;
else if(array[mid + 1] != target) return mid;
else down = mid + 1;
}
}
if(array[down] != target) return -1;
return down;
}
}