【LeetCode】506. Relative Ranks【E】【50】

最新推荐文章于 2021-11-21 23:33:03 发布

sscssz

最新推荐文章于 2021-11-21 23:33:03 发布

阅读量833

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode Python 算法排序文章标签： string dict leetcode leetcode题解排序

本文链接：https://blog.youkuaiyun.com/sscssz/article/details/56899905

Python 同时被 3 个专栏收录

176 篇文章

订阅专栏

leetcode

175 篇文章

订阅专栏

算法

157 篇文章

订阅专栏

本文介绍了一种算法，用于确定N位运动员的相对排名，并为前三名分配金、银、铜奖牌。通过字典排序及巧妙地处理输出，确保了排名与奖牌分配的准确性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze Medal".

Example 1:

Input: [5, 4, 3, 2, 1]
Output: ["Gold Medal", "Silver Medal", "Bronze Medal", "4", "5"]
Explanation: The first three athletes got the top three highest scores, so they got "Gold Medal", "Silver Medal" and "Bronze Medal". 
For the left two athletes, you just need to output their relative ranks according to their scores.

Note:

N is a positive integer and won't exceed 10,000.
All the scores of athletes are guaranteed to be unique.

Subscribe to see which companies asked this question.

其实逻辑上还是很简单，就是dict的排序只不过输出的时候需要一个trick，就是怎么把金银铜牌输出出来

class Solution(object):
    def findRelativeRanks(self, nums):

        dic = {}

        i = 0

        while i < len(nums):
            dic[i] = nums[i]
            i += 1

        l = sorted(dic.iteritems(),key = lambda k:k[1],reverse = True)
        res = ['']* len(nums)
        medal = ["Gold Medal", "Silver Medal", "Bronze Medal"]

        i = 0
        while i < min(3,len(nums)):
            res[l[i][0]] = medal[i]
            i += 1
        while i < len(nums):
            res[l[i][0]] = str(i+1)
            i += 1
        return res