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

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

506. Relative Ranks

2019-11-09 19:33:31
字體:
來源:轉載
供稿:網友

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;	}};


發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 远安县| 彰武县| 三都| 姚安县| 海伦市| 宿州市| 华蓥市| 同德县| 永康市| 景德镇市| 潮安县| 灵川县| 大冶市| 曲阜市| 霞浦县| 平顺县| 疏附县| 宜阳县| 辽宁省| 蒙自县| 芜湖市| 普兰县| 江山市| 沅陵县| 哈密市| 彭水| 莎车县| 唐山市| 镇坪县| 宁河县| 会宁县| 沿河| 定安县| 横峰县| 江北区| 阿勒泰市| 新民市| 闸北区| 苍梧县| 大埔县| 上饶市|