国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

506. Relative Ranks

2019-11-10 17:59:40
字體:
來源:轉載
供稿:網友

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.

Subscribe to see which companies asked this question.

給每一個數一個排名,前三名是金銀銅。這是排序的問題。將原序列的每個數的鍵值和值組成pair,然后按值從大到小排序。最后按順序給排名就行了。

代碼:

class Solution{public:	vector<string> findRelativeRanks(vector<int>& nums)	{		vector<pair<int, int> > vec;		vector<string> res(nums.size());		string ranks[3] = {"Gold Medal", "Silver Medal", "Bronze Medal"};		for(int i = 0; i < nums.size(); ++i) 			vec.push_back(pair<int, int>(i, nums[i]));		auto cmp = [](const pair<int, int>& p1, const pair<int, int>& p2) { return p1.second > p2.second; };		sort(vec.begin(), vec.end(), cmp);		for(int i = 0; i < nums.size(); ++i)		{			if(i < 3) res[vec[i].first] = ranks[i];			else res[vec[i].first] = to_string(i+1);		}		return res;	}};


發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 西昌市| 东丽区| 鞍山市| 安阳县| 徐水县| 赤水市| 南岸区| 河南省| 鄄城县| 定陶县| 仪陇县| 绥芬河市| 新化县| 黑龙江省| 闻喜县| 昌图县| 虞城县| 鱼台县| 山阳县| 读书| 宜黄县| 鄂尔多斯市| 延长县| 靖西县| 曲周县| 贡嘎县| 赣州市| 博乐市| 金坛市| 鄂州市| 定兴县| 望江县| 曲靖市| 洱源县| 德江县| 永福县| 顺义区| 开阳县| 集贤县| 嘉祥县| 济阳县|