[LeetCode&Python] Problem 506. Relative Ranks
Posted chiyeung
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode&Python] Problem 506. Relative Ranks相关的知识,希望对你有一定的参考价值。
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.
class Solution(object): def findRelativeRanks(self, nums): """ :type nums: List[int] :rtype: List[str] """ n=len(nums) if n==0: return nums elif n==1: return [‘Gold Medal‘] elif n==2: if nums[0]>nums[1]: return [‘Gold Medal‘,‘Silver Medal‘] else: return [‘Silver Medal‘,‘Gold Medal‘] ans=[] s=sorted(nums) a1=s[-1] a2=s[-2] a3=s[-3] for i in nums: if i==a1: ans.append(‘Gold Medal‘) elif i==a2: ans.append(‘Silver Medal‘) elif i==a3: ans.append(‘Bronze Medal‘) else: ans.append(str(n-s.index(i))) return ans
以上是关于[LeetCode&Python] Problem 506. Relative Ranks的主要内容,如果未能解决你的问题,请参考以下文章
C++&Python描述 LeetCode C++&Python描述 LeetCode 剑指 Offer 22. 链表中倒数第k个节点
[LeetCode&Python] Problem 202. Happy Number
[LeetCode&Python] Problem 520. Detect Capital
[LeetCode&Python] Problem 383. Ransom Note