LeetCode 506 Relative Ranks

题目：

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:

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

题目链接

题意：

有n个作家的分数，分数唯一不重复，要求给作家按分数排名，第一名是“Gold Medal”， 第二名是“Silver Medal”， 第三名是“Bronze Medal”，其他的名次将int转化为string。

解决方法是用一个数组来记录每一个分数的名次位置，在排序的时候把这个数组的变化也加上，最后可以直接通过分数查询名词。

代码如下：

class Solution {public:    vector<string> findRelativeRanks(vector<int>& nums) {        int a[1000010];        vector<int>temp = nums;        memset(a, -1, sizeof a);        for (int i = 0; i < nums.size(); i ++) {            a[nums[i]] = i + 1;        }        for (int i = 0; i < temp.size(); i ++) {            for (int j = 0; j < i; j ++) {                if (temp[i] > temp[j]) {                    swap(temp[i], temp[j]);                    swap(a[temp[i]], a[temp[j]]);                }            }        }        vector<string> ans;        for (int i = 0; i < nums.size(); i ++) {            int pos = a[nums[i]];            if (pos == 1) {                ans.push_back("Gold Medal");            }               else if (pos == 2) {                ans.push_back("Silver Medal");            }            else if (pos == 3) {                ans.push_back("Bronze Medal");            }            else {                ans.push_back(to_string(pos));            }        }        return ans;    }};

其中用于记录名次的数组用map代替可以。