algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-01 03:24:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: correct String.format() parameter passing error in climbing_stairs_*.java (#1807)

Browse Source
This commit is contained in:
PXG-XPG
2025-09-20 05:11:51 -06:00
committed by GitHub
parent 1e6a84119a
commit 909b89680f
5 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
en/codes/java/chapter_dynamic_programming/climbing_stairs_backtrack.java
View File

@ -39,6 +39,6 @@ public class climbing_stairs_backtrack {
int n = 9;
int res = climbingStairsBacktrack(n);
System.out.println(String.format("There are %d solutions to climb %d stairs", n, res));
System.out.println(String.format("There are %d solutions to climb %d stairs", res, n));
}
}

2
en/codes/java/chapter_dynamic_programming/climbing_stairs_constraint_dp.java
View File

@ -31,6 +31,6 @@ public class climbing_stairs_constraint_dp {
int n = 9;
int res = climbingStairsConstraintDP(n);
System.out.println(String.format("There are %d solutions to climb %d stairs", n, res));
System.out.println(String.format("There are %d solutions to climb %d stairs", res, n));
}
}

2
en/codes/java/chapter_dynamic_programming/climbing_stairs_dfs.java
View File

@ -26,6 +26,6 @@ public class climbing_stairs_dfs {
int n = 9;
int res = climbingStairsDFS(n);
System.out.println(String.format("There are %d solutions to climb %d stairs", n, res));
System.out.println(String.format("There are %d solutions to climb %d stairs", res, n));
}
}

4
en/codes/java/chapter_dynamic_programming/climbing_stairs_dfs_mem.java
View File

@ -36,6 +36,6 @@ public class climbing_stairs_dfs_mem {
int n = 9;
int res = climbingStairsDFSMem(n);
System.out.println(String.format("There are %d solutions to climb %d stairs", n, res));
System.out.println(String.format("There are %d solutions to climb %d stairs", res, n));
}
}
}

4
en/codes/java/chapter_dynamic_programming/climbing_stairs_dp.java
View File

@ -40,9 +40,9 @@ public class climbing_stairs_dp {
int n = 9;
int res = climbingStairsDP(n);
System.out.println(String.format("There are %d solutions to climb %d stairs", n, res));
System.out.println(String.format("There are %d solutions to climb %d stairs", res, n));
res = climbingStairsDPComp(n);
System.out.println(String.format("There are %d solutions to climb %d stairs", n, res));
System.out.println(String.format("There are %d solutions to climb %d stairs", res, n));
}
}