diff --git a/en/codes/java/chapter_dynamic_programming/climbing_stairs_backtrack.java b/en/codes/java/chapter_dynamic_programming/climbing_stairs_backtrack.java
index 5d196607c..247020625 100644
--- a/en/codes/java/chapter_dynamic_programming/climbing_stairs_backtrack.java
+++ b/en/codes/java/chapter_dynamic_programming/climbing_stairs_backtrack.java
@@ -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));
     }
 }
diff --git a/en/codes/java/chapter_dynamic_programming/climbing_stairs_constraint_dp.java b/en/codes/java/chapter_dynamic_programming/climbing_stairs_constraint_dp.java
index a67cb719f..9af0203ef 100644
--- a/en/codes/java/chapter_dynamic_programming/climbing_stairs_constraint_dp.java
+++ b/en/codes/java/chapter_dynamic_programming/climbing_stairs_constraint_dp.java
@@ -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));
     }
 }
diff --git a/en/codes/java/chapter_dynamic_programming/climbing_stairs_dfs.java b/en/codes/java/chapter_dynamic_programming/climbing_stairs_dfs.java
index 68236b653..5997b5ec6 100644
--- a/en/codes/java/chapter_dynamic_programming/climbing_stairs_dfs.java
+++ b/en/codes/java/chapter_dynamic_programming/climbing_stairs_dfs.java
@@ -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));
     }
 }
diff --git a/en/codes/java/chapter_dynamic_programming/climbing_stairs_dfs_mem.java b/en/codes/java/chapter_dynamic_programming/climbing_stairs_dfs_mem.java
index 217964bec..3aad1fd68 100644
--- a/en/codes/java/chapter_dynamic_programming/climbing_stairs_dfs_mem.java
+++ b/en/codes/java/chapter_dynamic_programming/climbing_stairs_dfs_mem.java
@@ -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));
     }
-}
\ No newline at end of file
+}
diff --git a/en/codes/java/chapter_dynamic_programming/climbing_stairs_dp.java b/en/codes/java/chapter_dynamic_programming/climbing_stairs_dp.java
index 07aed0017..f1d2c48e9 100644
--- a/en/codes/java/chapter_dynamic_programming/climbing_stairs_dp.java
+++ b/en/codes/java/chapter_dynamic_programming/climbing_stairs_dp.java
@@ -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));
     }
 }