mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
62 lines
1.2 KiB
HTML
62 lines
1.2 KiB
HTML
|
<code>Employee</code> 表:
|
|||
|
<div class="original__bRMd">
|
|||
|
<div>
|
|||
|
<pre>
|
|||
|
+-------------+------+
|
|||
|
| Column Name | Type |
|
|||
|
+-------------+------+
|
|||
|
| id | int |
|
|||
|
| salary | int |
|
|||
|
+-------------+------+
|
|||
|
id 是这个表的主键。
|
|||
|
表的每一行包含员工的工资信息。
|
|||
|
</pre>
|
|||
|
|
|||
|
<p> </p>
|
|||
|
|
|||
|
<p>编写一个 SQL 查询,获取并返回 <code>Employee</code> 表中第二高的薪水 。如果不存在第二高的薪水,查询应该返回 <code>null</code> 。</p>
|
|||
|
|
|||
|
<p>查询结果如下例所示。</p>
|
|||
|
|
|||
|
<p> </p>
|
|||
|
|
|||
|
<p><strong>示例 1:</strong></p>
|
|||
|
|
|||
|
<pre>
|
|||
|
<strong>输入:</strong>
|
|||
|
Employee 表:
|
|||
|
+----+--------+
|
|||
|
| id | salary |
|
|||
|
+----+--------+
|
|||
|
| 1 | 100 |
|
|||
|
| 2 | 200 |
|
|||
|
| 3 | 300 |
|
|||
|
+----+--------+
|
|||
|
<strong>输出:</strong>
|
|||
|
+---------------------+
|
|||
|
| SecondHighestSalary |
|
|||
|
+---------------------+
|
|||
|
| 200 |
|
|||
|
+---------------------+
|
|||
|
</pre>
|
|||
|
|
|||
|
<p><strong>示例 2:</strong></p>
|
|||
|
|
|||
|
<pre>
|
|||
|
<strong>输入:</strong>
|
|||
|
Employee 表:
|
|||
|
+----+--------+
|
|||
|
| id | salary |
|
|||
|
+----+--------+
|
|||
|
| 1 | 100 |
|
|||
|
+----+--------+
|
|||
|
<strong>输出:</strong>
|
|||
|
+---------------------+
|
|||
|
| SecondHighestSalary |
|
|||
|
+---------------------+
|
|||
|
| null |
|
|||
|
+---------------------+
|
|||
|
</pre>
|
|||
|
</div>
|
|||
|
</div>
|