给出 N 名运动员的成绩,找出他们的相对名次并授予前三名对应的奖牌。
前三名运动员将会被分别授予 “金牌”,“银牌” 和“ 铜牌”("Gold Medal", "Silver Medal", "Bronze Medal")。
(注:分数越高的选手,排名越靠前。)
示例 1:
输入: [5, 4, 3, 2, 1]
输出: ["Gold Medal", "Silver Medal", "Bronze Medal", "4", "5"]
解释: 前三名运动员的成绩为前三高的,因此将会分别被授予 “金牌”,“银牌”和“铜牌” ("Gold Medal", "Silver Medal" and "Bronze Medal").
余下的两名运动员,我们只需要通过他们的成绩计算将其相对名次即可。
提示:
N 是一个正整数并且不会超过 10000。
所有运动员的成绩都不相同。
import java.util.Arrays;
import java.util.HashMap;
class Solution {
public String[] findRelativeRanks(int[] nums) {
int nums_copy[] = nums.clone();
quickSort(nums, 0, nums.length - 1);
HashMap<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
map.put(nums[i], i + 1);
}
String[] ret = new String[nums.length];
for (int i = 0; i < nums_copy.length; i++) {
if (map.get(nums_copy[i]) == 1) ret[i] = "Gold Medal";
else if (map.get(nums_copy[i]) == 2) ret[i] = "Silver Medal";
else if (map.get(nums_copy[i]) == 3) ret[i] = "Bronze Medal";
else ret[i] = map.get(nums_copy[i]) + "";
}
return ret;
}
private void quickSort(int[] nums, int low, int high) {
if (low < high) {
int pivotPos = Partition(nums, low, high);
quickSort(nums, low, pivotPos - 1);
quickSort(nums, pivotPos + 1, high);
}
}
private int Partition(int[] nums, int low, int high) {
int pivot = nums[low];
while (low < high) {
while (low < high && nums[high] <= pivot) high--;
nums[low] = nums[high];
while (low < high && nums[low] >= pivot) low++;
nums[high] = nums[low];
}
nums[low] = pivot;
return low;
}
}
class Solution {
public String[] findRelativeRanks(int[] nums) {
int nums_copy[] = nums.clone();
Arrays.sort(nums);
int len = nums.length;
HashMap<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
map.put(nums[i], len - i);
}
String[] ret = new String[nums.length];
for (int i = 0; i < nums_copy.length; i++) {
if (map.get(nums_copy[i]) == 1) ret[i] = "Gold Medal";
else if (map.get(nums_copy[i]) == 2) ret[i] = "Silver Medal";
else if (map.get(nums_copy[i]) == 3) ret[i] = "Bronze Medal";
else ret[i] = map.get(nums_copy[i]) + "";
}
return ret;
}
}