2021-01-30（506. 相对名次）

想到了map进行排序，当没想到treemap和r[value]。

class Solution {
    public String[] findRelativeRanks(int[] nums) {
        int n = nums.length;
        String[] r = new String[n];
        Map<Integer, Integer> map = new TreeMap<>();
        for (int i = 0; i < n; i++) {
            map.put(nums[i], i);
        }
        int count = 0;
        for (Map.Entry<Integer, Integer> m : map.entrySet()) {
            int pm = n - count++;
            switch (pm) {
                case 1:
                    r[m.getValue()] = "Gold Medal";
                    break;
                case 2:
                    r[m.getValue()] = "Silver Medal";
                    break;
                case 3:
                    r[m.getValue()] = "Bronze Medal";
                    break;
                default:
                    r[m.getValue()] = String.valueOf(pm);
            }
        }
        return r;
    }
}