relative-ranks

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an integer array <code>score</code> of size <code>n</code>, where <code>score[i]</code> is the score of the <code>ith</code> athlete in a competition. All the scores are guaranteed to be unique.

The athletes are placed based on their scores, where the <code>1st</code> place athlete has the highest score, the <code>2nd</code> place athlete has the <code>2nd</code> highest score, and so on. The placement of each athlete determines their rank:

<ul>
	<li>The <code>1st</code> place athlete&#39;s rank is <code>&quot;Gold Medal&quot;</code>.</li>
	<li>The <code>2nd</code> place athlete&#39;s rank is <code>&quot;Silver Medal&quot;</code>.</li>
	<li>The <code>3rd</code> place athlete&#39;s rank is <code>&quot;Bronze Medal&quot;</code>.</li>
	<li>For the <code>4th</code> place to the <code>nth</code> place athlete, their rank is their placement number (i.e., the <code>xth</code> place athlete&#39;s rank is <code>&quot;x&quot;</code>).</li>
</ul>

Return an array <code>answer</code> of size <code>n</code> where <code>answer[i]</code> is the rank of the <code>ith</code> athlete.

&nbsp;
Example 1:

<pre>
Input: score = [5,4,3,2,1]
Output: [&quot;Gold Medal&quot;,&quot;Silver Medal&quot;,&quot;Bronze Medal&quot;,&quot;4&quot;,&quot;5&quot;]
Explanation: The placements are [1st, 2nd, 3rd, 4th, 5th].</pre>

Example 2:

<pre>
Input: score = [10,3,8,9,4]
Output: [&quot;Gold Medal&quot;,&quot;5&quot;,&quot;Bronze Medal&quot;,&quot;Silver Medal&quot;,&quot;4&quot;]
Explanation: The placements are [1st, 5th, 3rd, 2nd, 4th].

</pre>

&nbsp;
Constraints:

<ul>
	<li><code>n == score.length</code></li>
	<li><code>1 &lt;= n &lt;= 104</code></li>
	<li><code>0 &lt;= score[i] &lt;= 106</code></li>
	<li>All the values in <code>score</code> are unique.</li>
</ul>

findRelativeRanks

Relative Ranks

Array

Sorting

Heap (Priority Queue)

给你一个长度为 <code>n</code> 的整数数组 <code>score</code> ，其中 <code>score[i]</code> 是第 <code>i</code> 位运动员在比赛中的得分。所有得分都 互不相同 。

运动员将根据得分 决定名次 ，其中名次第 <code>1</code> 的运动员得分最高，名次第 <code>2</code> 的运动员得分第 <code>2</code> 高，依此类推。运动员的名次决定了他们的获奖情况：

<ul>
	<li>名次第 <code>1</code> 的运动员获金牌 <code>"Gold Medal"</code> 。</li>
	<li>名次第 <code>2</code> 的运动员获银牌 <code>"Silver Medal"</code> 。</li>
	<li>名次第 <code>3</code> 的运动员获铜牌 <code>"Bronze Medal"</code> 。</li>
	<li>从名次第 <code>4</code> 到第 <code>n</code> 的运动员，只能获得他们的名次编号（即，名次第 <code>x</code> 的运动员获得编号 <code>"x"</code>）。</li>
</ul>

使用长度为 <code>n</code> 的数组 <code>answer</code> 返回获奖，其中 <code>answer[i]</code> 是第 <code>i</code> 位运动员的获奖情况。

&nbsp;

示例 1：

<pre>
输入：score = [5,4,3,2,1]
输出：["Gold Medal","Silver Medal","Bronze Medal","4","5"]
解释：名次为 [1st, 2nd, 3rd, 4th, 5th] 。</pre>

示例 2：

<pre>
输入：score = [10,3,8,9,4]
输出：["Gold Medal","5","Bronze Medal","Silver Medal","4"]
解释：名次为 [1st, 5th, 3rd, 2nd, 4th] 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>n == score.length</code></li>
	<li><code>1 &lt;= n &lt;= 104</code></li>
	<li><code>0 &lt;= score[i] &lt;= 106</code></li>
	<li><code>score</code> 中的所有值 互不相同</li>
</ul>