leetcode506: 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.（这一点很重要）

注意：暴力破解的方法是先将原数组排序再在依次取出。再在原数组中寻找取出的元素，在String数组（返回的数组）中的相同位置上放置排序的编号。最后在将前三名替换成金牌、银牌、铜牌。排序的方法是用的最快的排序方法（也是最占空间的），时间复杂度主要是由于要同时遍历排序数组和原数组，应该有更好的方法减小时间复杂度，也许不是用排序的方法。可能很多人使用了快速排序，导致时间复杂度略大。

	public String[] findRelativeRanks(int[] nums) {
		String[] s = new String[nums.length];
		int flag = 1;
		int max = nums[0];
		for (int i = 0; i < nums.length; i++)
			if (nums[i] > max)
				max = nums[i];
		int[] sup = new int[max + 1];
		for (int i = 0; i < sup.length; i++)
			sup[i] = 0;
		for (int i = 0; i < nums.length; i++)
			sup[nums[i]] = 1;
		for (int i = sup.length - 1; i >= 0; i--) {
			if (sup[i] == 1) {
				for (int j = 0; j < nums.length; j++)
					if (nums[j] == i)
						s[j] = Integer.toString(flag);
				flag++;
			}
		}
		for (int i = 0; i < s.length; i++)
			if (s[i].equals("1"))
				s[i] = "Gold Medal";
			else if (s[i].equals("2"))
				s[i] = "Silver Medal";
			else if (s[i].equals("3"))
				s[i] = "Bronze Medal";
		return s;
	}