LeetCode 506. Relative Ranks

最新推荐文章于 2025-07-26 17:01:26 发布

原创最新推荐文章于 2025-07-26 17:01:26 发布 · 249 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个简单但易错的算法问题：根据运动员的成绩找出他们的相对排名，并为前三名分配金牌、银牌和铜牌。通过示例说明了输入输出格式及预期解释。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:
N is a positive integer and won’t exceed 10,000.
All the scores of athletes are guaranteed to be unique.
Subscribe to see which companies asked this question.

这个题目看起来挺简单的，但一不小心就会掉坑里去。下面是楼主自己写的，作为一个leetcode新手，希望大家多多指教。
class Solution {
public:
vector findRelativeRanks(vector& nums) {
vector result(nums.size());
int n = nums.size();
const string s1 = “Gold Medal”;
const string s2 = “Silver Medal”;
const string s3 = “Bronze Medal”;
int *hash_table = new int[65535000];
for(int i = 0; i