-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRelativeRanks.java
More file actions
43 lines (31 loc) · 1.08 KB
/
Copy pathRelativeRanks.java
File metadata and controls
43 lines (31 loc) · 1.08 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
package LeetcodePractice;
import java.util.Arrays;
public class RelativeRanks {
public static String[] findRelativeRanks(int[] score) {
int n = score.length;
String[] result = new String[n];
int[][] arr = new int[n][2];
for (int i = 0; i < n; i++) {
arr[i][0] = score[i];
arr[i][1] = i;
}
Arrays.sort(arr, (a, b) -> b[0] - a[0]);
for (int i = 0; i < n; i++) {
if (i == 0)
result[arr[i][1]] = "Gold Medal";
else if (i == 1)
result[arr[i][1]] = "Silver Medal";
else if (i == 2)
result[arr[i][1]] = "Bronze Medal";
else
result[arr[i][1]] = String.valueOf(i + 1);
}
return result;
}
public static void main(String[] args) {
int[] score1 = {5, 4, 3, 2, 1};
System.out.println(Arrays.toString(findRelativeRanks(score1)));
int[] score2 = {10, 3, 8, 9, 4};
System.out.println(Arrays.toString(findRelativeRanks(score2)));
}
}