mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
60 lines
1.3 KiB
HTML
60 lines
1.3 KiB
HTML
<p>Table: <code>Employee</code></p>
|
|
|
|
<pre>
|
|
+-------------+------+
|
|
| Column Name | Type |
|
|
+-------------+------+
|
|
| id | int |
|
|
| salary | int |
|
|
+-------------+------+
|
|
id is the primary key (column with unique values) for this table.
|
|
Each row of this table contains information about the salary of an employee.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
|
|
<p>Write a solution to find the <code>n<sup>th</sup></code> highest salary from the <code>Employee</code> table. If there is no <code>n<sup>th</sup></code> highest salary, return <code>null</code>.</p>
|
|
|
|
<p>The result format is in the following example.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong>
|
|
Employee table:
|
|
+----+--------+
|
|
| id | salary |
|
|
+----+--------+
|
|
| 1 | 100 |
|
|
| 2 | 200 |
|
|
| 3 | 300 |
|
|
+----+--------+
|
|
n = 2
|
|
<strong>Output:</strong>
|
|
+------------------------+
|
|
| getNthHighestSalary(2) |
|
|
+------------------------+
|
|
| 200 |
|
|
+------------------------+
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong>
|
|
Employee table:
|
|
+----+--------+
|
|
| id | salary |
|
|
+----+--------+
|
|
| 1 | 100 |
|
|
+----+--------+
|
|
n = 2
|
|
<strong>Output:</strong>
|
|
+------------------------+
|
|
| getNthHighestSalary(2) |
|
|
+------------------------+
|
|
| null |
|
|
+------------------------+
|
|
</pre>
|