描述
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 the nth place athlete, their rank is their placement number (i.e., the xth 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].
Note:
n == score.length
1 <= n <= 104
0 <= score[i] <= 106
All the values in score are unique.
解析
根据题意，就是给所有数字排名次，前三名用字符串表示，其余都用数字表示。思路比较简单，先对 score 降序排列，然后用字典 d 将每个元素的名次保存下来，最后再将 score 列表中的元素通过 d 转换成对应的名次字符串即可。
解答
class Solution(object):
def findRelativeRanks(self, score):
"""
:type score: List[int]
:rtype: List[str]
"""
tmp = sorted(score, reverse=True)
d = {}
for i in range(len(score)):
if i+1 == 1:
d[tmp[i]] = "Gold Medal"
elif i+1 == 2:
d[tmp[i]] = "Silver Medal"
elif i+1 == 3:
d[tmp[i]] ="Bronze Medal"
else:
d[tmp[i]]= str(i+1)
return [d[c] for c in score]
运行结果
Runtime: 56 ms, faster than 67.42% of Python online submissions for Relative Ranks.
Memory Usage: 14.5 MB, less than 39.33% of Python online submissions for Relative Ranks.
原题链接：leetcode.com/problems/re…
您的支持是我最大的动力
