-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution2.java
49 lines (37 loc) · 1.52 KB
/
Solution2.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
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
public class Solution2 {
public HashMap<Integer, Superior> getSuperiorMap(int[] ranks){
HashMap<Integer, Superior> superiorRankMap = new HashMap<Integer, Superior>();
Integer max = 0;
for(int i=0; i<ranks.length; i++) {
Integer superiorRank = ranks[i] + 1;
if(superiorRankMap.containsKey(superiorRank)) {
superiorRankMap.get(superiorRank).numberOfSoldiersReporting++;
}else {
Superior superior = new Superior();
superior.rank = superiorRank;
superior.numberOfSoldiersReporting = 1;
superiorRankMap.put(superiorRank, superior);
}
}
return superiorRankMap;
}
public int solution(int[] ranks) {
if(ranks.length == 0)
return 0;
int numberOfSoldiersWithSameSuperior = 0;
List<Integer> uniqueRankList = new ArrayList<Integer>();
for(int i=0; i<ranks.length; i++) {
if(!uniqueRankList.contains(ranks[i]))
uniqueRankList.add(ranks[i]);
}
HashMap<Integer, Superior> superiorRankMap = getSuperiorMap(ranks);
for (Integer key: superiorRankMap.keySet()){
if(uniqueRankList.contains(key))
numberOfSoldiersWithSameSuperior += superiorRankMap.get(key).numberOfSoldiersReporting;
}
return numberOfSoldiersWithSameSuperior;
}
}