mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-13 01:15:14 +08:00
update
This commit is contained in:
@@ -13,7 +13,7 @@ Each row of this table contains information about the salary of an employee.
|
||||
|
||||
<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>Write a solution to find the <code>n<sup>th</sup></code> highest <strong>distinct</strong> salary from the <code>Employee</code> table. If there are less than <code>n</code> distinct salaries, return <code>null</code>.</p>
|
||||
|
||||
<p>The result format is in the following example.</p>
|
||||
|
||||
|
Reference in New Issue
Block a user