mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
60 lines
1.2 KiB
HTML
60 lines
1.2 KiB
HTML
<p>表: <code>Employee</code></p>
|
||
|
||
<pre>
|
||
+-------------+------+
|
||
| Column Name | Type |
|
||
+-------------+------+
|
||
| id | int |
|
||
| salary | int |
|
||
+-------------+------+
|
||
在 SQL 中，id 是该表的主键。
|
||
该表的每一行都包含有关员工工资的信息。
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p>查询 <code>Employee</code> 表中第 <code>n</code> 高的工资。如果没有第 <code>n</code> 个最高工资，查询结果应该为 <code>null</code> 。</p>
|
||
|
||
<p>查询结果格式如下所示。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1:</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入:</strong>
|
||
Employee table:
|
||
+----+--------+
|
||
| id | salary |
|
||
+----+--------+
|
||
| 1 | 100 |
|
||
| 2 | 200 |
|
||
| 3 | 300 |
|
||
+----+--------+
|
||
n = 2
|
||
<strong>输出:</strong>
|
||
+------------------------+
|
||
| getNthHighestSalary(2) |
|
||
+------------------------+
|
||
| 200 |
|
||
+------------------------+
|
||
</pre>
|
||
|
||
<p><strong>示例 2:</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入:</strong>
|
||
Employee 表:
|
||
+----+--------+
|
||
| id | salary |
|
||
+----+--------+
|
||
| 1 | 100 |
|
||
+----+--------+
|
||
n = 2
|
||
<strong>输出:</strong>
|
||
+------------------------+
|
||
| getNthHighestSalary(2) |
|
||
+------------------------+
|
||
| null |
|
||
+------------------------+</pre>
|