本文主要是介绍LeetCode-506. Relative Ranks，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
问题：https://leetcode.com/problems/relative-ranks/?tab=Description
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.
给一个数组，为几个运动员的分数，返回他们的排名，如果前三名应该为”Gold Medal”, “Silver Medal”, “Bronze Medal”，否则是数字名次。运动员的分数不重复。
分析：拷贝一个相同的数组arry，然后排序，从nums[i]中寻找与arr[j]相同的分数，如果j=0,1,2则是”Gold Medal”, “Silver Medal”, “Bronze Medal”，其他是名次为j+1。
参考C++代码：
class Solution {
public: vector<string> findRelativeRanks(vector<int>& nums) {vector<int> arr = nums;sort(arr.begin(), arr.end());reverse(arr.begin(),arr.end());vector<string> result(nums.size());for (int i = 0; i < nums.size(); i++) {for (int j = 0; j < nums.size(); j++) {if (nums[i] == arr[j]) {if(j==0) result[i] = "Gold Medal";else if(j==1) result[i] = "Silver Medal";else if(j==2) result[i] = "Bronze Medal"; else result[i] = to_string(j + 1); }}}return result;}
};这篇关于LeetCode-506. Relative Ranks的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
