[leetcode]506. Relative Ranks

[leetcode]506. Relative Ranks


Analysis

讨厌的人总是那么讨厌!—— [ummmm~]

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”.
简单的排名问题。

Implement

class Solution {
public:
    vector<string> findRelativeRanks(vector<int>& nums) {
        vector<int> copy;
        for(auto num:nums){
            copy.push_back(num);
        }
        sort(copy.begin(), copy.end());

        map<int, int> ranks;
        for(int i=0; i<copy.size(); i++)
            ranks[copy[i]] = i+1;
        int len = nums.size();
        vector<string> res;
        for(auto num:nums){
            if(ranks[num] == len)
                res.push_back("Gold Medal");
            else if(ranks[num] == len-1)
                res.push_back("Silver Medal");
            else if(ranks[num] == len-2)
                res.push_back("Bronze Medal");
            else
                res.push_back(to_string(len+1-ranks[num]));
        }
        return res;
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值