leetCode练习（242）

题目：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.

解题思路：在将nums排序的同时，保留原先的位置信息。这里使用TreeMap<Integer,Integer> map；key为nums的值，value为其索引。在insert时，map会自动将其排序。完成后使用迭代器时，就已经是顺序排列了。此时读取索引，赋值给String[]即可。

代码如下：

public class Solution {
    private final String FIRST="Gold Medal";
	private final String SECOND="Silver Medal";
	private final String THIRD="Bronze Medal";
	
	public String[] findRelativeRanks(int[] nums) {
		int count = nums.length;
		int ji = count;
		String[] res = new String[count];
		TreeMap<Integer,Integer> map=frb(nums);
		Iterator<Integer> ito = map.keySet().iterator();
		if(count>=3){
			for(int i=count;i>3;i--){
				ito.hasNext();
				res[map.get(ito.next())]=Integer.toString(ji--);
			}
			ito.hasNext();
			res[map.get(ito.next())]=THIRD;
			ito.hasNext();
			res[map.get(ito.next())]=SECOND;
			ito.hasNext();
			res[map.get(ito.next())]=FIRST;
			return res;
		}else{
			if(count==2){
				ito.hasNext();
				res[map.get(ito.next())]=SECOND;
				ito.hasNext();
				res[map.get(ito.next())]=FIRST;
				return res;
			}else if(count ==1){
				ito.hasNext();
				res[map.get(ito.next())]=FIRST;
				return res;
			}
		}
		return res;
    }
	
	private TreeMap<Integer,Integer> frb(int[] nums){
    	TreeMap<Integer,Integer> map = new TreeMap<>();
		int i=0;
		for(int w:nums){
			map.put(w, i++);
		}
		return map;
	}
}