You are viewing a single comment's thread. Return to all comments →
python3 solution:
def climbingLeaderboard(ranked, player): return_ar = [] max_rank = len(set(ranked)) player_rank = len(player) ranked.reverse() unique_list = list(set(ranked)) unique_list.sort() i = 0 p = 0 p_last_score = -99
while p < player_rank: item = unique_list[i] p_rank = player[p] if item == unique_list[-1]: if p_rank < unique_list[-1]: return_ar.append(2) else: return_ar.append(1) p += 1 elif p_rank == p_last_score and len(return_ar) > 0: return_ar.append(return_ar[-1]) p += 1 elif p_rank < item: return_ar.append(max_rank + 1) p += 1 elif p_rank == item: return_ar.append(max_rank) p += 1 elif p_rank > item: i += 1 max_rank -= 1 continue p_last_score = p_rank return return_ar
Seems like cookies are disabled on this browser, please enable them to open this website
Climbing the Leaderboard
You are viewing a single comment's thread. Return to all comments →
python3 solution:
def climbingLeaderboard(ranked, player): return_ar = [] max_rank = len(set(ranked)) player_rank = len(player) ranked.reverse() unique_list = list(set(ranked)) unique_list.sort() i = 0 p = 0 p_last_score = -99