[Leet Code] Relative Ranks

Input: score = [5,4,3,2,1]
Output: ["Gold Medal","Silver Medal","Bronze Medal","4","5"]
Explanation: The placements are [1st, 2nd, 3rd, 4th, 5th].
Input: score = [10,3,8,9,4]
Output: ["Gold Medal","5","Bronze Medal","Silver Medal","4"]
Explanation: The placements are [1st, 5th, 3rd, 2nd, 4th].
class Solution(object):
def findRelativeRanks(self, score):
:type score: List[int]
:rtype: List[str]
sorted_array = sorted(score, reverse=True)
result_list = []
for i in score:
result = sorted_array.index(i) + 1
if result == 1:
result_list.append("Gold Medal")
elif result == 2:
result_list.append("Silver Medal")
elif result == 3:
result_list.append("Bronze Medal")
return result_list




Learning, and posting my findings!

Love podcasts or audiobooks? Learn on the go with our new app.

Lec01 資料結構 第一週課程 | 筆記

Patterns of Kubernetes API Extensions

I Don’t Think it’s Agile you Hate

Miner Rewards go Live on Flux Labs

How to Build Telemedicine Application

The Ubuntu Installation Guide

GraphQL vs REST: A High-Level Comparison

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Matthew Boyd

Matthew Boyd

Learning, and posting my findings!

More from Medium

Remove Zero Sum Consecutive Nodes from Linked List

Search — Algorithm in JAVA

What is a Queue?

Why do Software Engineers need to consider more about time zones?