[LeetCode]Relative Ranks
作者是 在线疯狂 发布于 2017年2月5日 在 LeetCode.

题目描述：

LeetCode 506. Relative Ranks

Given scores of N athletes, find their relative ranks and the men 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:

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

题目大意；

给定N名运动员的得分，输出他们的名次。前三名分别输出“金奖”，“银奖”，“铜奖”。

注意：

1. N是正整数并且不超过10000。
2. 所有运动员的得分是唯一的。

解题思路：

排序（Sort）

Python代码：

class Solution(object):
    def findRelativeRanks(self, nums):
        """
        :type nums: List[int]
        :rtype: List[str]
        """
        dmap = {v : k for k, v in enumerate(sorted(nums, reverse=True))}
        return [str(dmap[n] + 1) \
               if dmap[n] > 2 \
               else ['Gold', 'Silver', 'Bronze'][dmap[n]] + ' Medal' for n in nums]

 

本文链接：https://bookshadow.com/weblog/2017/02/05/leetcode-relative-ranks/
请尊重作者的劳动成果，转载请注明出处！书影博客保留对文章的所有权利。