LeetCode：Relative Ranks

最新推荐文章于 2021-01-27 11:06:15 发布

Chan_Keh

最新推荐文章于 2021-01-27 11:06:15 发布

阅读量442

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/lwgechen/article/details/56852461

版权

LeetCode 专栏收录该内容

101 篇文章

订阅专栏

本文介绍了一种算法，该算法能够根据运动员的成绩找出他们的相对排名，并为前三名分配金牌、银牌和铜牌。此外，对于剩余的运动员，算法会根据其成绩给出相应的排名。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
public:
    vector<string> findRelativeRanks(vector<int>& nums) {
        vector<string>result;
        vector<int>temp = nums;
        int maxnum ;
        //= *max(nums.begin(),nums.end());
        maxnum = nums[0];
        for(int i=0;i<nums.size();++i)
        {
            if(maxnum<nums[i])
                 maxnum = nums[i];              
        }
        vector<int>count;
       for(int i=0;i<maxnum+1;++i)
       {
           count.push_back(0);
       }

        sort(nums.begin(),nums.end());
        reverse(nums.begin(),nums.end());
        for(int i=0;i<nums.size();++i)
        {
           count[nums[i]] = i;    
        }
        for(int i=0;i<temp.size();++i)
        {
            if(count[temp[i]]==0)
               result.push_back("Gold Medal");
             else  if(count[temp[i]]==1)
               result.push_back("Silver Medal");
              else if(count[temp[i]]==2)
               result.push_back("Bronze Medal");
               else
               {
                   stringstream ss;
                   ss<<(count[temp[i]]+1);
                   string str;
                   ss>>str;
                   result.push_back(str);
               }
        }
        return result;
    }
};