[LeetCode] 506. Relative Ranks_Easy tag: Sort

Posted

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] 506. Relative Ranks_Easy tag: Sort相关的知识,希望对你有一定的参考价值。

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:

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

 

Code

class Solution:
    def findRelativeRanks(self, nums):
        if len(nums) == 1: return ["Gold Medal"]
        if len(nums) == 2: return ["Gold Medal", "Silver Medal"] if nums[0] > nums[1] else ["Silver Medal", "Gold Medal"]
        ans, d = [0]*len(nums), sorted([(num, index) for index, num in enumerate(nums)], reverse = True)
        ans[d[0][1]], ans[d[1][1]], ans[d[2][1]] =  "Gold Medal", "Silver Medal", "Bronze Medal"
        for i in range(3, len(d)):
            ans[d[i][1]] = str(i+1)
        return ans

 


以上是关于[LeetCode] 506. Relative Ranks_Easy tag: Sort的主要内容,如果未能解决你的问题,请参考以下文章

[LeetCode&Python] Problem 506. Relative Ranks

[LeetCode] 506. Relative Ranks

leetcode 506. ????????????(Relative Ranks)

Leetcode 506. Relative Ranks

[LeetCode] 506. Relative Ranks_Easy tag: Sort

LeetCode算法题-Relative Ranks(Java实现)