forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path_506.java
37 lines (33 loc) · 1.13 KB
/
_506.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
package com.fishercoder.solutions;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
public class _506 {
public static class Solution1 {
public String[] findRelativeRanks(int[] nums) {
int[] tmp = new int[nums.length];
for (int i = 0; i < nums.length; i++) {
tmp[i] = nums[i];
}
Arrays.sort(tmp);
Map<Integer, String> rankMap = new HashMap();
int len = nums.length;
for (int i = len - 1; i >= 0; i--) {
if (i == len - 1) {
rankMap.put(tmp[i], "Gold Medal");
} else if (i == len - 2) {
rankMap.put(tmp[i], "Silver Medal");
} else if (i == len - 3) {
rankMap.put(tmp[i], "Bronze Medal");
} else {
rankMap.put(tmp[i], String.valueOf(len - i));
}
}
String[] result = new String[len];
for (int i = 0; i < len; i++) {
result[i] = rankMap.get(nums[i]);
}
return result;
}
}
}