[LeetCode] Relative Ranks

标签：使用   结果   tmp   relative   osi   public   tco   code   添加   

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.

使用一个临时数组存储原数组按逆序排序后的元素，遍历临时数组，找出临时数组中元素在原数组中的位置。然后根据该位置在结果字符串数组中添加排名信息。效率不是很高，但是还是成功AC。

class Solution {
public:
    vector<string> findRelativeRanks(vector<int>& nums) {
        vector<string> res(nums.size(), "");
        vector<int> tmp(nums.begin(), nums.end());
        sort(tmp.begin(), tmp.end(), [](int a, int b) { return a > b; });
        for (int i = 0; i != tmp.size(); i++) {
            for (int j = 0; j != nums.size(); j++) {
                if (nums[j] == tmp[i]) {
                    if (i == 0)
                        res[j] = "Gold Medal";
                    else if (i == 1)
                        res[j] = "Silver Medal";
                    else if (i == 2)
                        res[j] = "Bronze Medal";
                    else
                        res[j] = to_string(i + 1);
                }
            }
        }
        return res;
    }
};
// 209 ms

[LeetCode] Relative Ranks

标签：使用   结果   tmp   relative   osi   public   tco   code   添加   

原文地址：http://www.cnblogs.com/immjc/p/7190698.html