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

175 篇文章 0 订阅
157 篇文章 0 订阅

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.

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

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值