-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMap.java
72 lines (54 loc) · 1.3 KB
/
Map.java
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
public class Map {
public static void main(String[] args) {
int[] arr = { 1, 2, 3, 4, 5 };
int me1 = -1;
int c1 = 0;
int me2 = -1;
int c2 = 0;
for (int i : arr) {
if (me1 == i) {
c1++;
} else if (me2 == i) {
c2++;
} else if (c1 == 0) {
me1 = i;
c1++;
} else if (c2 == 0) {
me2 = i;
c2++;
} else {
c1--;
c2--;
}
}
c1 = 0;
c2 = 0;
for (int i : arr) {
if (me1 == i) {
c1++;
} else if (me2 == i) {
c2++;
}
}
ArrayList<Integer> result = new ArrayList<>();
if (c1 > arr.length / 3) {
result.add(me1);
}
if (c2 > arr.length / 3) {
result.add(me2);
}
if (result.isEmpty()) {
result.add(-1);
} else {
Collections.sort(result);
}
for (Integer integer : result) {
System.out.println(integer);
}
}
public class Entry<T1, T2> {
}
}