mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
47 lines
932 B
HTML
47 lines
932 B
HTML
<p>表：<code>Logs</code></p>
|
||
|
||
<pre>
|
||
+-------------+---------+
|
||
| Column Name | Type |
|
||
+-------------+---------+
|
||
| id | int |
|
||
| num | varchar |
|
||
+-------------+---------+
|
||
在 SQL 中，id 是该表的主键。
|
||
id 是一个自增列。</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p>找出所有至少连续出现三次的数字。</p>
|
||
|
||
<p>返回的结果表中的数据可以按 <strong>任意顺序</strong> 排列。</p>
|
||
|
||
<p>结果格式如下面的例子所示：</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1:</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>
|
||
Logs 表：
|
||
+----+-----+
|
||
| id | num |
|
||
+----+-----+
|
||
| 1 | 1 |
|
||
| 2 | 1 |
|
||
| 3 | 1 |
|
||
| 4 | 2 |
|
||
| 5 | 1 |
|
||
| 6 | 2 |
|
||
| 7 | 2 |
|
||
+----+-----+
|
||
<strong>输出：</strong>
|
||
Result 表：
|
||
+-----------------+
|
||
| ConsecutiveNums |
|
||
+-----------------+
|
||
| 1 |
|
||
+-----------------+
|
||
<strong>解释：</strong>1 是唯一连续出现至少三次的数字。</pre>
|