Skip to content

Commit 4972ae2

Browse files
authored
docs: update readme to lc problem: No.0177 (doocs#592)
No.0177.Nth Highest Salary
1 parent e2ceede commit 4972ae2

File tree

1 file changed

+0
-17
lines changed

1 file changed

+0
-17
lines changed

solution/0100-0199/0177.Nth Highest Salary/README_EN.md

-17
Original file line numberDiff line numberDiff line change
@@ -6,48 +6,31 @@
66

77
<p>Write a SQL query to get the <em>n</em><sup>th</sup> highest salary from the <code>Employee</code> table.</p>
88

9-
10-
119
<pre>
1210

1311
+----+--------+
14-
1512
| Id | Salary |
16-
1713
+----+--------+
18-
1914
| 1 | 100 |
20-
2115
| 2 | 200 |
22-
2316
| 3 | 300 |
24-
2517
+----+--------+
2618

2719
</pre>
2820

29-
30-
3121
<p>For example, given the above Employee table, the <em>n</em><sup>th</sup> highest salary where <em>n</em> = 2 is <code>200</code>. If there is no <em>n</em><sup>th</sup> highest salary, then the query should return <code>null</code>.</p>
3222

33-
34-
3523
<pre>
3624

3725
+------------------------+
38-
3926
| getNthHighestSalary(2) |
40-
4127
+------------------------+
42-
4328
| 200 |
44-
4529
+------------------------+
4630

4731
</pre>
4832

4933

50-
5134
## Solutions
5235

5336
<!-- tabs:start -->

0 commit comments

Comments
 (0)