LeetCode | 506. Relative Ranks

Givenscores of N athletes, find their relative ranks and the people with thetop three highest scores, who will be awarded medals: "Gold Medal","Silver Medal" and "Bronze Medal".

Example1:

Input: [5, 4, 3, 2, 1]

Output: ["Gold Medal", "SilverMedal", "Bronze Medal", "4", "5"]

Explanation: The first three athletes got the topthree highest scores, so they got "Gold Medal", "SilverMedal" and "Bronze Medal".
For the left two athletes, you just need to output their relative ranksaccording to their scores.

Note:

1.      N is a positive integer and won'texceed 10,000.

2.      All the scores of athletes areguaranteed to be unique.

简单题,先把原数组按照其分数从高到低排序(注意是按照分数从高到低排序),然后按照其排序完成之后的顺序修改其对应位置上的string标志就好了,

class Solution {
public:
    static bool cmp(pair<int, int> &a, pair<int, int> &b)
{
	return a.second > b.second;
}
vector<string> findRelativeRanks(vector<int>& nums) {
	int n = nums.size();
	vector<string> result(n,"");
	vector<pair<int, int>> temp;
	for (int i = 0; i < n; i++)
	{
		temp.push_back(pair<int, int>(i, nums[i]));
	}
	sort(temp.begin(), temp.end(),cmp);
	if (n >= 1) result[temp[0].first] = "Gold Medal";
	if (n >= 2) result[temp[1].first] = "Silver Medal";
	if (n >= 3) result[temp[2].first] = "Bronze Medal";
	for (int i = 4; i <= n; i++)
	{
		result[temp[i - 1].first] = to_string(i);
	}
	return result;
}
};

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值