Leetcode - Time Based Key-Value Store
Leetcode - Longest Harmonious Subsequence

Leetcode - Design A Leaderboard

violet posted @ Apr 17, 2020 05:52:06 AM in 算法 with tags Algorithm Golang sort , 763 阅读

https://leetcode.com/problems/design-a-leaderboard/

Design a Leaderboard class, which has 3 functions:

  1. addScore(playerId, score): Update the leaderboard by adding score to the given player's score. If there is no player with such id in the leaderboard, add him to the leaderboard with the given score.
  2. top(K): Return the score sum of the top K players.
  3. reset(playerId): Reset the score of the player with the given id to 0. It is guaranteed that the player was added to the leaderboard before calling this function.

Initially, the leaderboard is empty.

 

Example 1:

Input: 
["Leaderboard","addScore","addScore","addScore","addScore","addScore","top","reset","reset","addScore","top"]
[[],[1,73],[2,56],[3,39],[4,51],[5,4],[1],[1],[2],[2,51],[3]]
Output: 
[null,null,null,null,null,null,73,null,null,null,141]

Explanation: 
Leaderboard leaderboard = new Leaderboard ();
leaderboard.addScore(1,73);   // leaderboard = [[1,73]];
leaderboard.addScore(2,56);   // leaderboard = [[1,73],[2,56]];
leaderboard.addScore(3,39);   // leaderboard = [[1,73],[2,56],[3,39]];
leaderboard.addScore(4,51);   // leaderboard = [[1,73],[2,56],[3,39],[4,51]];
leaderboard.addScore(5,4);    // leaderboard = [[1,73],[2,56],[3,39],[4,51],[5,4]];
leaderboard.top(1);           // returns 73;
leaderboard.reset(1);         // leaderboard = [[2,56],[3,39],[4,51],[5,4]];
leaderboard.reset(2);         // leaderboard = [[3,39],[4,51],[5,4]];
leaderboard.addScore(2,51);   // leaderboard = [[2,51],[3,39],[4,51],[5,4]];
leaderboard.top(3);           // returns 141 = 51 + 51 + 39;

 

type Leaderboard struct {
    count []int
    
}


func Constructor() Leaderboard {
    return Leaderboard {
        count: make([]int, 10000),
    }
}


func (this *Leaderboard) AddScore(playerId int, score int)  {
    this.count[playerId] += score
}


func (this *Leaderboard) Top(K int) int {
    tmp := make([]int, len(this.count))
    copy(tmp, this.count)
    sort.Slice(tmp, func(i, j int) bool {
        if tmp[i] > tmp[j] {
            return true
        }
        return false
    })
    sum := 0
    for i := 0; i < K; i++ {
        sum += tmp[i]
    }
    return sum
}


func (this *Leaderboard) Reset(playerId int)  {
    this.count[playerId] = 0
}


/**
 * Your Leaderboard object will be instantiated and called as such:
 * obj := Constructor();
 * obj.AddScore(playerId,score);
 * param_2 := obj.Top(K);
 * obj.Reset(playerId);
 */

登录 *


loading captcha image...
(输入验证码)
or Ctrl+Enter