Relative Ranks问题及解法

最新推荐文章于 2022-01-14 22:32:02 发布

我们要爱学习

最新推荐文章于 2022-01-14 22:32:02 发布

阅读量331

点赞数

分类专栏： LeetCode算法练习（Easy）文章标签： LeetCode Easy

本文链接：https://blog.csdn.net/u011809767/article/details/71191369

版权

LeetCode算法练习（Easy）专栏收录该内容

156 篇文章 3 订阅

订阅专栏

问题描述：

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".

Note:

N is a positive integer and won't exceed 10,000.
All the scores of athletes are guaranteed to be unique.

示例：

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.

问题分析：

利用hashtable求解即可，过程详见代码：

class Solution {
public:
    vector<string> findRelativeRanks(vector<int>& nums) {
        vector<int> nums2 = nums;
        sort(nums.begin(),nums.end());
        map<int,int> m;
        vector<string> res;
        for(int i = nums.size() - 1,j = 1;i >= 0 ; i--)
        {
        	m.insert(pair<int,int>(nums[i],j++));
		}
		for(int i = 0; i < nums2.size(); i++)
		{
			if(m[nums2[i]] == 1) res.push_back("Gold Medal");
			else if(m[nums2[i]] == 2) res.push_back("Silver Medal");
			else if(m[nums2[i]] == 3) res.push_back("Bronze Medal");
			else res.push_back(to_string(m[nums2[i]])); // c++ 11支持 
		}
		return res;
    }
};