leetCode506

版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。
本文链接: https://blog.csdn.net/qq_36257146/article/details/102718335
class Solution {
public:
    vector<string> findRelativeRanks(vector<int>& nums) {
        vector<int>order;
        vector<string>ans(nums.size());
        for(int i = 0;i<nums.size();i++) order.push_back(i);
        sort(order.begin(),order.end(),[&nums](const int&a,const int&b){return nums[a]>nums[b];});
        for(int i = 0;i<order.size();i++)
        {
            switch(i)
            {
                case 0:
                    ans[order[i]] = "Gold Medal";
                    break;
                case 1:
                    ans[order[i]] = "Silver Medal";
                    break;
                case 2:
                   ans[order[i]] = "Bronze Medal";
                    break;
                default:
                    ans[order[i]] = to_string(i+1);
                    break;
            }
        }
        return ans;
    }
};

猜你喜欢

转载自blog.csdn.net/qq_36257146/article/details/102718335
今日推荐