We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0ea1b34 commit 9549726Copy full SHA for 9549726
README.md
@@ -28,7 +28,7 @@
28
| 数据结构 | [Interview-8:二叉树中序遍历的下一个节点](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-8.md) |
29
| 数据结构 | [Interview-9:用两个栈实现队列](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-9.md) |
30
| 数据结构 | [Interview-10:斐波那契数列](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-10.md) |
31
-| 数据结构 | [Inverview59:队列的最大值](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Inverview-59.md) |
+| 数据结构 | [Inverview-59:队列的最大值](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Inverview-59.md) |
32
33
34
0 commit comments