mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-12 19:01:47 +08:00
存量题库数据更新
This commit is contained in:
@@ -1,23 +1,44 @@
|
||||
<p>编写一个 SQL 查询,查找 <code>Person</code> 表中所有重复的电子邮箱。</p>
|
||||
<p><meta charset="UTF-8" /></p>
|
||||
|
||||
<p><strong>示例:</strong></p>
|
||||
<p>表: <code>Person</code></p>
|
||||
|
||||
<pre>+----+---------+
|
||||
| Id | Email |
|
||||
<pre>
|
||||
+-------------+---------+
|
||||
| Column Name | Type |
|
||||
+-------------+---------+
|
||||
| id | int |
|
||||
| email | varchar |
|
||||
+-------------+---------+
|
||||
id 是该表的主键(具有唯一值的列)。
|
||||
此表的每一行都包含一封电子邮件。电子邮件不包含大写字母。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p>编写解决方案来报告所有重复的电子邮件。 请注意,可以保证电子邮件字段不为 NULL。</p>
|
||||
|
||||
<p>以 <strong>任意顺序 </strong>返回结果表。</p>
|
||||
|
||||
<p>结果格式如下例。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong>
|
||||
Person 表:
|
||||
+----+---------+
|
||||
| id | email |
|
||||
+----+---------+
|
||||
| 1 | a@b.com |
|
||||
| 2 | c@d.com |
|
||||
| 3 | a@b.com |
|
||||
+----+---------+
|
||||
</pre>
|
||||
|
||||
<p>根据以上输入,你的查询应返回以下结果:</p>
|
||||
|
||||
<pre>+---------+
|
||||
<strong>输出:</strong>
|
||||
+---------+
|
||||
| Email |
|
||||
+---------+
|
||||
| a@b.com |
|
||||
+---------+
|
||||
</pre>
|
||||
|
||||
<p><strong>说明:</strong>所有电子邮箱都是小写字母。</p>
|
||||
<strong>解释:</strong> a@b.com 出现了两次。</pre>
|
||||
|
Reference in New Issue
Block a user