We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 510716d commit 3603b49Copy full SHA for 3603b49
README.md
@@ -145,5 +145,5 @@
145
- [minimum-depth-of-binary-tree(求解二叉树的最小深度)](./LeetCode/Doc/二叉树的最小深度.md)
146
- [evaluate-reverse-polish-notation(计算逆波兰式的值)](./LeetCode/Doc/计算逆波兰式的值.md)
147
- [max-points-on-a-line(同一条直线上的最多的点的数量)](./LeetCode/Doc/同一条直线上的最多的点的数量.md)
148
-- [sort-list(排序List)](./LeetCode/Doc/排序List.md.md)
+- [sort-list(排序List)](./LeetCode/Doc/排序List.md)
149
0 commit comments