forked from anishLearnsToCode/leetcode-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathRelativeRanks.java
66 lines (58 loc) · 2.03 KB
/
RelativeRanks.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
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class RelativeRanks {
static class Pair {
private final int index;
private final int value;
Pair(int index, int value) {
this.index = index;
this.value = value;
}
@Override
public String toString() {
return "Pair{" +
"index=" + index +
", value=" + value +
'}';
}
}
private static List<Pair> getValuesWithIndex(int[] array) {
List<Pair> result = new ArrayList<>();
for (int index = 0 ; index < array.length ; index++) {
result.add(new Pair(index, array[index]));
}
return result;
}
private static Map<Integer, Integer> getValueToIndexMap(List<Pair> array) {
Map<Integer, Integer> result = new HashMap<>();
for (int index = 0 ; index < array.size() ; index++) {
result.put(array.get(index).value, index);
}
return result;
}
private static String getRank(int position) {
switch (position) {
case 1: return "Gold Medal";
case 2: return "Silver Medal";
case 3: return "Bronze Medal";
default: return position + "";
}
}
public static String[] findRelativeRanks(int[] score) {
List<Pair> sortedScores = getValuesWithIndex(score);
sortedScores.sort(((o1, o2) -> Integer.compare(o2.value, o1.value)));
System.out.println(sortedScores);
Map<Integer, Integer> value2index = getValueToIndexMap(sortedScores);
String[] result = new String[score.length];
for (int index = 0 ; index < score.length ; index++) {
result[index] = getRank(value2index.get(score[index]) + 1);
}
return result;
}
public static void main(String[] args) {
System.out.println(Arrays.toString(findRelativeRanks(new int[]{10, 3, 8, 9, 4})));
}
}