zoukankan      html  css  js  c++  java
  • Rank Scores

    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    |
    +-------+------+
     
    目前给出的方案只能排序,而且有hole:
    select s1.Score, (select count(1)+1 from Scores as s2  where s2.Score > s1.Score )as Rank from Scores  as s1 order by s1.Score desc;

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

    select s1.Score, (select count(distinct s2.Score) from Scores as s2  where s2.Score > s1.Score ) + 1 as Rank from Scores  as s1 order by s1.Score desc ;

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

  • 相关阅读:
    Codeforces Round448 D
    Codeforces Round448 C Square Subsets
    hdu6006
    2017计蒜客计算之道初赛第六场 微软大楼设计方案(困难)
    UVA 12105 Bigger is Better
    Codeforce 55D Beautiful numbers
    4月补题
    C++小技巧之CONTAINING_RECORD
    Codeforces #380 div2 E(729E) Subordinates
    Codeforces #380 div2 D(729D) Sea Battle
  • 原文地址:https://www.cnblogs.com/dslover/p/4314521.html
Copyright © 2011-2022 走看看