leetcode 506. 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.

水题，快排赛高！

package leetcode;

import java.util.Arrays;

public class Relative_Ranks_506 {

	public String[] findRelativeRanks(int[] nums) {
		int n=nums.length;
		if(n==1){
			return new String[]{"Gold Medal"};
		}
		if(n==2){
			if(nums[0]>nums[1]){
				return new String[]{"Gold Medal","Silver Medal"};
			}
			else{
				return new String[]{"Silver Medal","Gold Medal"};
			}
		}
		int[] index=new int[n];
		for(int i=0;i<n;i++){
			index[i]=i;
		}
		quickSort(nums, index, 0, n-1);
		String[] result=new String[n];
		result[index[0]]="Gold Medal";//index前3位记录了排名前三位的index
		result[index[1]]="Silver Medal";
		result[index[2]]="Bronze Medal";
		for(int i=3;i<n;i++){
			result[index[i]]=(i+1)+"";
		}
		return result;
	}
	
	public void quickSort(int[] nums,int[] index,int left,int right){
		if(left<right){
			int low=left;
			int high=right;
			int pivot=nums[low];
			int tmp=index[low];
			while(low<high){
				while(low<high&&nums[high]<=pivot){
					high--;
				}
				nums[low]=nums[high];
				index[low]=index[high];
				while(low<high&&nums[low]>=pivot){
					low++;
				}
				nums[high]=nums[low];
				index[high]=index[low];
			}
			nums[low]=pivot;
			index[low]=tmp;
			quickSort(nums, index, left, low-1);
			quickSort(nums, index, low+1, right);
		}
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Relative_Ranks_506 r=new Relative_Ranks_506();
		int[] nums=new int[]{1};
		System.out.println(Arrays.toString(r.findRelativeRanks(nums)));
	}

}

大神解法跟我一样，都是 find out the  score  ->  ranking  mapping. 用的是Arrays.sort，这个语法我不精，需要好好学学。

Time complexity: O(NlgN). Space complexity: O(N). N is the number of scores.

Example:

nums[i]    : [10, 3, 8, 9, 4]
pair[i][0] : [10, 3, 8, 9, 4]
pair[i][1] : [ 0, 1, 2, 3, 4]

After sort:
pair[i][0] : [10, 9, 8, 4, 3]
pair[i][1] : [ 0, 3, 2, 4, 1]

public class Solution {
    public String[] findRelativeRanks(int[] nums) {
        int[][] pair = new int[nums.length][2];
        
        for (int i = 0; i < nums.length; i++) {
            pair[i][0] = nums[i];
            pair[i][1] = i;
        }
        
        Arrays.sort(pair, (a, b) -> (b[0] - a[0]));
        
        String[] result = new String[nums.length];

        for (int i = 0; i < nums.length; i++) {
            if (i == 0) {
                result[pair[i][1]] = "Gold Medal";
            }
            else if (i == 1) {
                result[pair[i][1]] = "Silver Medal";
            }
            else if (i == 2) {
                result[pair[i][1]] = "Bronze Medal";
            }
            else {
                result[pair[i][1]] = (i + 1) + "";
            }
        }

        return result;
    }
}

Also we can use an one dimension array. This will save a little bit space but space complexity is still O(n).

public class Solution {
    public String[] findRelativeRanks(int[] nums) {
        Integer[] index = new Integer[nums.length];
        
        for (int i = 0; i < nums.length; i++) {
            index[i] = i;
        }
        
        Arrays.sort(index, (a, b) -> (nums[b] - nums[a]));
        
        String[] result = new String[nums.length];

        for (int i = 0; i < nums.length; i++) {
            if (i == 0) {
                result[index[i]] = "Gold Medal";
            }
            else if (i == 1) {
                result[index[i]] = "Silver Medal";
            }
            else if (i == 2) {
                result[index[i]] = "Bronze Medal";
            }
            else {
                result[index[i]] = (i + 1) + "";
            }
        }

        return result;
    }
}