506. 相对名次(javascript)506. Relative Ranks

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

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

名次第 1 的运动员获金牌 “Gold Medal” 。
名次第 2 的运动员获银牌 “Silver Medal” 。
名次第 3 的运动员获铜牌 “Bronze Medal” 。
从名次第 4 到第 n 的运动员,只能获得他们的名次编号(即,名次第 x 的运动员获得编号 “x”)。
使用长度为 n 的数组 answer 返回获奖,其中 answer[i] 是第 i 位运动员的获奖情况。

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

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

The 1st place athlete’s rank is “Gold Medal”.
The 2nd place athlete’s rank is “Silver Medal”.
The 3rd place athlete’s rank is “Bronze Medal”.
For the 4th place to the nth place athlete, their rank is their placement number (i.e., the xth place athlete’s rank is “x”).
Return an array answer of size n where answer[i] is the rank of the ith athlete.

示例 1:

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

示例 2:

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

提示:

n == score.length
1 <= n <= 104
0 <= score[i] <= 106
score 中的所有值 互不相同

解题思路:
首先你怎么知道运动员的名次呢,需要将分数降序排列,再根据分数匹配他在score中的位置,将他的分数改成他的名次,前三名特殊对待

sort会改变原数组,所以需要保存排序之前的数据

var findRelativeRanks = function (score) {
    let scoreList = JSON.parse(JSON.stringify(score))
    score.sort((a, b) => {
        return b - a
    })
    for (let i = 0; i < score.length; i++) {
        let index = scoreList.indexOf(score[i])
        //i + 1代表名次
        scoreList[index] = i + 1 + ''
        if (i == 0) {
            scoreList[index] = 'Gold Medal'
        } else if (i == 1) {
            scoreList[index] = 'Silver Medal'
        } else if (i == 2) {
            scoreList[index] = 'Bronze Medal'
        }
    }
    return scoreList
};

leetcode:https://leetcode.cn/problems/relative-ranks/

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值