LeetCode OJ Consecutive Numbers

Write a SQL query to find all numbers that appear at least three times consecutively.

+----+-----+
| Id | Num |
+----+-----+
| 1  |  1  |
| 2  |  1  |
| 3  |  1  |
| 4  |  2  |
| 5  |  1  |
| 6  |  2  |
| 7  |  2  |
+----+-----+

For example, given the above Logs table, 1 is the only number that appears consecutively for at least three times.

select distinct a.num from Logs a, Logs b, Logs c where a.id = b.id + 1 and b.id = c.id + 1 and a.num = b.num and b.num = c.num;

LeetCode OJ Consecutive Numbers

原文：http://blog.csdn.net/u012925008/article/details/45010643