LeetCode-506. Relative Ranks

问题:https://leetcode.com/problems/relative-ranks/?tab=Description
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.
给一个数组,为几个运动员的分数,返回他们的排名,如果前三名应该为”Gold Medal”, “Silver Medal”, “Bronze Medal”,否则是数字名次。运动员的分数不重复。
分析:拷贝一个相同的数组arry,然后排序,从nums[i]中寻找与arr[j]相同的分数,如果j=0,1,2则是”Gold Medal”, “Silver Medal”, “Bronze Medal”,其他是名次为j+1。
参考C++代码:

class Solution {
public: 
    vector<string> findRelativeRanks(vector<int>& nums) {
       vector<int> arr = nums;
        sort(arr.begin(), arr.end());
        reverse(arr.begin(),arr.end());
        vector<string> result(nums.size());
        for (int i = 0; i < nums.size(); i++) {
            for (int j = 0; j < nums.size(); j++) {
                if (nums[i] == arr[j]) {
                        if(j==0)  result[i] = "Gold Medal";
                        else if(j==1) result[i] = "Silver Medal";
                        else if(j==2)  result[i] = "Bronze Medal"; 
                        else result[i] = to_string(j + 1); 
                }
            }
        }
        return result;
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值