(Easy) Relative Ranks - LeetCode

Description:

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.

 

Accepted
45,308
Submissions
92,843

Solution:

class Solution {
    public String[] findRelativeRanks(int[] nums) {
        if(nums==null||nums.length==0){
            return null;
        }
        
        int[] nums2= new int[nums.length];
        
        for(int i = 0;i <nums.length; i++ ){
            nums2[i]=nums[i];
        }
        Arrays.sort(nums);
        
    
        
        String [] res =new String[nums.length];
        
        for(int i =0; i<nums.length; i++){
         
            int rank = 0;
            
            rank = getRank(nums, nums2[i]);
            
            String rank_String = "";
            
            if(rank == 1){
                rank_String = "Gold Medal";
            }
            else if(rank == 2){
                
                rank_String = "Silver Medal";
            }
            else if (rank ==3){
                rank_String = "Bronze Medal";
            }
            else{
                rank_String = Integer.toString(rank);
            }
           res[i] =rank_String;
          
        }

        return res;
    }
    
    public int getRank(int[] nums, int tar){
        
        for(int i =0; i<nums.length; i++){
            if(nums[i]==tar){
                return nums.length-i ;
            }
        }
        return -1;
    }
}

 

posted @ 2019-08-29 16:54  CodingYM  阅读(107)  评论(0编辑  收藏  举报