506.相对名次

最新推荐文章于 2024-05-11 11:36:37 发布

facination with wonder

最新推荐文章于 2024-05-11 11:36:37 发布

阅读量44

点赞数

分类专栏：力扣—排序文章标签： leetcode 算法数据结构 python

本文链接：https://blog.csdn.net/la_brave_man/article/details/130477826

版权

力扣—排序专栏收录该内容

2 篇文章 0 订阅

订阅专栏

506. 相对名次

方法一：排序+index()

class Solution:
    def findRelativeRanks(self, score: List[int]) -> List[str]:
        new_score = sorted(score,reverse = True)
        n = len(score)
        answer = [0] * n
        for i in range(n):
            ind = new_score.index(score[i])
            if ind == 0:
                answer[i] = "Gold Medal"
            elif ind == 1:
                answer[i] = "Silver Medal"
            elif ind == 2:
                answer[i] = "Bronze Medal"
            else:
                answer[i] = str(ind + 1)
        return answer

方法二：排序+哈希表

class Solution:
    def findRelativeRanks(self, score: List[int]) -> List[str]:
        new_score = sorted(score,reverse = True)
        n = len(score)
        answer = [0] * n
        new_score1 = {}   
        for i in range(n):
            new_score1[new_score[i]] = i + 1
        for j in range(n):
            if new_score1[score[j]] == 1:
                answer[j] = "Gold Medal"
            elif new_score1[score[j]] == 2:
                answer[j] = "Silver Medal"
            elif new_score1[score[j]] == 3:
                answer[j] = "Bronze Medal"
            else:
                answer[j] = str(new_score1[score[j]])
        return answer