Leetcode 178. Rank Scores (Database)

参考: https://my.oschina.net/Tsybius2014/blog/493244

常见的排序1. 排名1,2,3,...,n 不对重复的分数做特殊处理

Score  Rank

100     1

99     2

99     3

98     4

90     5

# Write your MySQL query statement below
select Score, @Counter := @Counter + 1 as rank
from Scores, (select @Counter := 0) as C
order by Score desc;

排序2. 相同分数排名相同,排名第n名表示前面有n-1个人,而不是n-1个分数。

Score  Rank

100     1

99     2

99     2

98     4

90     5

# Write your MySQL query statement below
select S1.Score, (
select count(Score) + 1
from Scores S2
where S1.Score < S2.Score )
as Rank
from Scores S1 order by Score desc

排序3. 相同分数排名相同,第n名表示前面有n-1个分数。

Score  Rank

100     1

99     2

99     2

98     3

90     4

# Write your MySQL query statement below
select s.Score, count(distinct t.Score) Rank
from Scores s join Scores t on s.Score <= t.Score    #join 和 inner join是
group by s.Id
order by s.Score desc;
时间: 2024-11-09 15:00:12

Leetcode 178. Rank Scores (Database)的相关文章

sql -leetcode 178. Rank Scores

Score 很好得到: select Score from Scores order by Score desc; 要得到rank, 可以通过比较比当前Score 大的Score 的个数得到: select Score, (select count(distinct Score) from Scores where Score>=s.Score) Rank where Scores s order by Score desc; 或者: select s.Score ,count(distinct

LeetCode:Rank Scores - 按分数排名次

1.题目名称 Rank Scores(按分数排名次) 2.题目地址 https://leetcode.com/problems/rank-scores/ 3.题目内容 按分数排名次,如果两个Id的分数一样,那么他们的名次是一样的,排名从1开始.注意,每组分数的名次,都是上一组分数名次加一. 例如,有这样一组数据: +----+-------+ | Id | Score | +----+-------+ | 1  | 3.50  | | 2  | 3.65  | | 3  | 4.00  | | 

[LeetCode][SQL]Rank Scores

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 "ho

178. Rank Scores (Medium)

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" be

178. Rank Scores solution

problem: 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

LeetCode Database: 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" be

178.LeetCode 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" be

[LeetCode] 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" be

[LeetCode] Rank Scores -- 数据库知识(mysql)

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" be