leetcode 506. Relative Ranks

import java.util.Set;
import java.util.TreeSet;

/**
 * 506. Relative Ranks
 * @author tangmin
 * @create 2017年3月6日 上午11:53:43
 */
public class RelativeRanks {
	Set<Pair> treeSet = new TreeSet<Pair>();
	public String[] findRelativeRanks(int[] nums) {
		for (int i=0;i<nums.length; i++) 
			treeSet.add(new Pair(i,nums[i]));
		String[] res = new String[nums.length];
		Pair[] pairs = new Pair[nums.length]; 
		treeSet.toArray(pairs);
//		for (int i = 0; i < pairs.length; i++) {
//			System.out.println(pairs[i].k+","+pairs[i].v);
//		}
		for (int i=0;i<pairs.length;i++){
			if (i==pairs.length-1) 
				res[pairs[i].k] = "Gold Medal";
			else if(i==pairs.length-2)
				res[pairs[i].k] = "Silver Medal";
			else if(i==pairs.length-3)
				res[pairs[i].k] = "Bronze Medal";
			else
				res[pairs[i].k] = String.valueOf(pairs.length-i);
		}

		return res;
	}
	
	public static void main(String[]  args) {
		RelativeRanks rr = new RelativeRanks();
		int[] nums = {5,4,3,2,1};
		String[] s = rr.findRelativeRanks(nums);
		for (int i = 0; i < s.length; i++) {
			System.out.println(s[i]);
		}
	}
}

class Pair implements Comparable<Pair>{
	public int k;
	public int v;
	public Pair(int k, int v) {
		this.k = k;
		this.v = v;
	}
	@Override
	public int compareTo(Pair p) {
		// TODO Auto-generated method stub
		return Integer.compare(v, p.v);
	}
}