506. 相对名次

Author: w2xi

README.md

@@ -98,6 +98,7 @@
 |485|[最大连续 1 的个数](https://leetcode.cn/problems/max-consecutive-ones/)|[JavaScript](./algorithms/max-consecutive-ones.js)|Easy|
 |495|[提莫攻击](https://leetcode.cn/problems/teemo-attacking/)|[JavaScript](./algorithms/teemo-attacking.js)|Easy|
 |498|[对角线遍历](https://leetcode.cn/problems/diagonal-traverse/)|[JavaScript](./algorithms/diagonal-traverse.js)|Medium|
+|506|[相对名次](https://leetcode.cn/problems/relative-ranks/)|[JavaScript](./algorithms/relative-ranks.js)|Easy|
 |509|[斐波那契数](https://leetcode.cn/problems/fibonacci-number/)|[JavaScript](./algorithms/fibonacci-number.js)|Easy|
 |515|[在每个树行中找最大值](https://leetcode.cn/problems/find-largest-value-in-each-tree-row/)|[JavaScript](./algorithms/find-largest-value-in-each-tree-row.js)|Medium|
 |520|[检测大写字母](https://leetcode.cn/problems/detect-capital/)|[JavaScript](./algorithms/detect-capital.js)|Easy|

algorithms/relative-ranks.js

@@ -0,0 +1,33 @@
+/**
+ * @param {number[]} score
+ * @return {string[]}
+ */
+var findRelativeRanks = function (score) {
+  // 对得分从高到低进行排序
+  const top = score.slice().sort((a, b) => b - a);
+  const result = [];
+  const o = {};
+
+  // 哈希表 保存 score[i] 的原始索引
+  for (let i = 0; i < score.length; i++) {
+    o[score[i]] = i;
+  }
+  for (let i = 0; i < top.length; i++) {
+    // 原始索引
+    const originalIndex = o[top[i]];
+    // 排名
+    let rank = i + 1;
+    if (rank === 1) {
+      answer = "Gold Medal";
+    } else if (rank === 2) {
+      answer = "Silver Medal";
+    } else if (rank === 3) {
+      answer = "Bronze Medal";
+    } else {
+      answer = rank.toString();
+    }
+    result[originalIndex] = answer;
+  }
+
+  return result;
+};