zoukankan      html  css  js  c++  java
  • 分数排名

    Write a SQL query to rank scores. If there is a tie between two scores, both should have the same ranking. Note that after a tie, the next ranking number should be the next consecutive integer value. In other words, there should be no "holes" between ranks.

    +----+-------+
    | Id | Score |
    +----+-------+
    | 1  | 3.50  |
    | 2  | 3.65  |
    | 3  | 4.00  |
    | 4  | 3.85  |
    | 5  | 4.00  |
    | 6  | 3.65  |
    +----+-------+
    

    For example, given the above Scores table, your query should generate the following report (order by highest score):

    +-------+------+
    | Score | Rank |
    +-------+------+
    | 4.00  | 1    |
    | 4.00  | 1    |
    | 3.85  | 2    |
    | 3.65  | 3    |
    | 3.65  | 3    |
    | 3.50  | 4    |
    +-------+------+
    

    分数排名 - LeetCode (中国) https://leetcode-cn.com/problems/rank-scores/description/

     优化 简化  

    SELECT s.Score,tt.Rank FROM Scores s LEFT JOIN

    (
    SELECT (@i:=@i+1) Rank,t.* FROM (SELECT COUNT(Id) AS c,Score FROM Scores GROUP BY Score ORDER BY Score DESC ) AS t , (SELECT @i:=0) AS a
    ) AS tt ON s.Score=tt.Score ORDER BY Rank ASC;

  • 相关阅读:
    51nod1711 平均数
    51nod1204 Parity
    51nod1274 最长递增路径
    51nod1403 有趣的堆栈
    51nod1364 最大字典序排列
    bzoj1857: [Scoi2010]传送带
    bzoj3224: Tyvj 1728 普通平衡树
    bzoj2396: 神奇的矩阵
    bzoj2428: [HAOI2006]均分数据
    splay入门
  • 原文地址:https://www.cnblogs.com/rsapaper/p/9094645.html
Copyright © 2011-2022 走看看