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.
复制代码
class Solution {
    class Athlete {
        int index;
        int score;
        public Athlete(int index, int score) {
            this.index = index;
            this.score = score;
        }
    }
    public String[] findRelativeRanks(int[] nums) {
        if (nums == null || nums.length <= 0)
            return new String[0];
        String[] ret = new String[nums.length];
        Athlete[] athletes = new Athlete[nums.length];
        for (int i=0; i<nums.length; i++) {
            athletes[i] = new Athlete(i, nums[i]);
        }
        Arrays.sort(athletes, new Comparator<Athlete>() {
            @Override
            public int compare(Athlete o1, Athlete o2) {
                return o2.score - o1.score;
            }
        });
        for (int i=0; i<athletes.length; i++) {
            Athlete a = athletes[i];
            if (i == 0)
                ret[a.index] = "Gold Medal";
            else if (i == 1)
                ret[a.index] = "Silver Medal";
            else if (i == 2)
                ret[a.index] = "Bronze Medal";
            else 
                ret[a.index] = String.valueOf(i+1);
        }
        return ret;
    }
}
复制代码

 

 

 

 
posted @   Pickle  阅读(168)  评论(0编辑  收藏  举报
编辑推荐:
· 用 C# 插值字符串处理器写一个 sscanf
· Java 中堆内存和栈内存上的数据分布和特点
· 开发中对象命名的一点思考
· .NET Core内存结构体系(Windows环境)底层原理浅谈
· C# 深度学习:对抗生成网络(GAN)训练头像生成模型
阅读排行:
· 手把手教你更优雅的享受 DeepSeek
· AI工具推荐:领先的开源 AI 代码助手——Continue
· 探秘Transformer系列之(2)---总体架构
· V-Control:一个基于 .NET MAUI 的开箱即用的UI组件库
· 乌龟冬眠箱湿度监控系统和AI辅助建议功能的实现
历史上的今天:
2015-08-16 二叉查找(排序)树的分析与实现
2015-08-16 链队列的实现
点击右上角即可分享
微信分享提示