506. 相对名次
506. 相对名次
🟢 🔖 数组
排序
堆(优先队列)
🔗 力扣
LeetCode
题目
You are given an integer array score
of size n
, where score[i]
is the score of the ith
athlete in a competition. All the scores are guaranteed to be unique.
The athletes are placed based on their scores, where the 1st
place athlete has the highest score, the 2nd
place athlete has the 2nd
highest score, and so on. The placement of each athlete determines their rank:
- The
1st
place athlete's rank is"Gold Medal"
. - The
2nd
place athlete's rank is"Silver Medal"
. - The
3rd
place athlete's rank is"Bronze Medal"
. - For the
4th
place to thenth
place athlete, their rank is their placement number (i.e., thexth
place athlete's rank is"x"
).
Return an array answer
of size n
where answer[i]
is the rank of the ith
athlete.
Example 1:
Input: score = [5,4,3,2,1]
Output: ["Gold Medal","Silver Medal","Bronze Medal","4","5"]
Explanation: The placements are [1st, 2nd, 3rd, 4th, 5th].
Example 2:
Input: score = [10,3,8,9,4]
Output: ["Gold Medal","5","Bronze Medal","Silver Medal","4"]
Explanation: The placements are [1st, 5th, 3rd, 2nd, 4th].
Constraints:
n == score.length
1 <= n <= 10^4
0 <= score[i] <= 10^6
- All the values in
score
are unique.
题目大意
给你一个长度为 n
的整数数组 score
,其中 score[i]
是第 i
位运动员在比赛中的得分。所有得分都 互不相同 。
运动员将根据得分 决定名次 ,其中名次第 1
的运动员得分最高,名次第 2
的运动员得分第 2
高,依此类推。运动员的名次决定了他们的获奖情况:
- 名次第
1
的运动员获金牌"Gold Medal"
。 - 名次第
2
的运动员获银牌"Silver Medal"
。 - 名次第
3
的运动员获铜牌"Bronze Medal"
。 - 从名次第
4
到第n
的运动员,只能获得他们的名次编号(即,名次第x
的运动员获得编号"x"
)。
使用长度为 n
的数组 answer
返回获奖,其中 answer[i]
是第 i
位运动员的获奖情况。
解题思路
可以先将成绩排序,将每个成绩对应的名次用哈希表存起来,然后按照原始顺序从哈希表中取出名次,返回即可。
代码
/**
* @param {number[]} score
* @return {string[]}
*/
var findRelativeRanks = function (score) {
const rank = [...score].sort((a, b) => b - a);
let map = new Map();
rank.map((val, index) => {
if (index == 0) {
map.set(val, 'Gold Medal');
} else if (index == 1) {
map.set(val, 'Silver Medal');
} else if (index == 2) {
map.set(val, 'Bronze Medal');
} else {
map.set(val, String(index + 1));
}
});
return score.map((i) => map.get(i));
};