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 1472ba0 commit e7e9909Copy full SHA for e7e9909
algorithms/HouseRobber/README.md
@@ -38,4 +38,4 @@ int rob(int num[], int n) {
38
39
## 扩展
40
41
-[House Robber II](../House Robber II): 当大街是一条环的情况,即第一个和最后一个是相邻的情况
+[House Robber II](../HouseRobberII): 当大街是一条环的情况,即第一个和最后一个是相邻的情况
0 commit comments