leetcode 506. Relative Ranks(easy)

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.

Subscribe to see which companies asked this question.

题目的含义很简答，就是找到数组间数字的大小关系然后打印出来。这里采用比较笨的方法，其实还可以以空间换时间，用一个10000的数组来完成。

class Solution {
public:
    vector<string> findRelativeRanks(vector<int>& nums) {
        //采用的思想比较简单，就是用一个map结构排序并且保存排序结果，然后遍历一遍原数组输出
        vector<int> temp;
        vector<string> result;
        for(int i=0;i<nums.size();i++)
        {
           temp.push_back(nums[i]);
        }
        sort(temp.begin(),temp.end());
        vector<int>::iterator iter = temp.begin();
        int len = nums.size();
        for(int i=0;i<nums.size();i++)
        {
            
            vector<int>::iterator pos = find(temp.begin(),temp.end(),nums[i]);
            int dis =  pos - iter;
            //cout<<"hj"<<dis<<endl;
            if(dis == len-1)
                 result.push_back("Gold Medal");
            else if(dis == len-2)
                 result.push_back("Silver Medal");
            else if(dis == len-3)
                 result.push_back("Bronze Medal");
            else
            {
                stringstream ss;
                ss<<len-dis;
                result.push_back(ss.str());
            }
        }
        return result;
    }
};