g0501_0600.s0506_relative_ranks.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0501_0600.s0506_relative_ranks;

// #Easy #Array #Sorting #Heap_Priority_Queue #2022_07_24_Time_11_ms_(72.65%)_Space_53_MB_(80.23%)

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;

/**
 * 506 - Relative Ranks\.
 *
 * Easy
 *
 * You are given an integer array `score` of size `n`, where `score[i]` is the score of the i^th athlete in a competition. All the scores are guaranteed to be **unique**.
 *
 * The athletes are **placed** based on their scores, where the 1^st place athlete has the highest score, the 2^nd place athlete has the 2^nd highest score, and so on. The placement of each athlete determines their rank:
 *
 * *   The 1^st place athlete's rank is `"Gold Medal"`.
 * *   The 2^nd place athlete's rank is `"Silver Medal"`.
 * *   The 3^rd place athlete's rank is `"Bronze Medal"`.
 * *   For the 4^th place to the n^th place athlete, their rank is their placement number (i.e., the x^th place athlete's rank is `"x"`).
 *
 * Return an array `answer` of size `n` where `answer[i]` is the **rank** of the i^th athlete.
 *
 * **Example 1:**
 *
 * **Input:** score = [5,4,3,2,1]
 *
 * **Output:** ["Gold Medal","Silver Medal","Bronze Medal","4","5"]
 *
 * **Explanation:** The placements are [1^st, 2^nd, 3^rd, 4^th, 5^th].
 *
 * **Example 2:**
 *
 * **Input:** score = [10,3,8,9,4]
 *
 * **Output:** ["Gold Medal","5","Bronze Medal","Silver Medal","4"]
 *
 * **Explanation:** The placements are [1^st, 5^th, 3^rd, 2^nd, 4^th].
 *
 * **Constraints:**
 *
 * *   `n == score.length`
 * *   1 <= n <= 10⁴
 * *   0 <= score[i] <= 10⁶
 * *   All the values in `score` are **unique**.
**/
public class Solution {
    public String[] findRelativeRanks(int[] nums) {
        int[] tmp = new int[nums.length];
        System.arraycopy(nums, 0, tmp, 0, nums.length);
        Arrays.sort(tmp);
        Map rankMap = new HashMap<>();
        int len = nums.length;
        for (int i = len - 1; i >= 0; i--) {
            if (i == len - 1) {
                rankMap.put(tmp[i], "Gold Medal");
            } else if (i == len - 2) {
                rankMap.put(tmp[i], "Silver Medal");
            } else if (i == len - 3) {
                rankMap.put(tmp[i], "Bronze Medal");
            } else {
                rankMap.put(tmp[i], String.valueOf(len - i));
            }
        }
        String[] result = new String[len];
        for (int i = 0; i < len; i++) {
            result[i] = rankMap.get(nums[i]);
        }
        return result;
    }
}