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 |
    +-------+------+

  • 相关阅读:
    响应式布局,流式布局与固定布局
    垃圾回收机制
    形象讲解时间复杂度
    数据结构和算法简介
    数据结构之栈和队列
    十、str的索引、切片和str常用的操作方法(重点)
    九、基础数类型总览和str、int、bool之间的相互转化
    八、编码的初识和进阶
    七、格式化输出和运算符
    六、while循环
  • 原文地址:https://www.cnblogs.com/dslover/p/4314521.html
Copyright © 2011-2022 走看看