translation: Add Python and Java code for EN version (#1345)

* Add the intial translation of code of all the languages * test * revert * Remove * Add Python and Java code for EN version
2026-07-01 10:04:23 +00:00 · 2024-05-06 05:21:51 +08:00
parent b5e198db7d
commit 1c0f350ad6
174 changed files with 12349 additions and 0 deletions
@@ -0,0 +1,44 @@
+/**
+ * File: climbing_stairs_backtrack.java
+ * Created Time: 2023-06-30
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_dynamic_programming;
+
+import java.util.*;
+
+public class climbing_stairs_backtrack {
+    /* Backtracking */
+    public static void backtrack(List<Integer> choices, int state, int n, List<Integer> res) {
+        // When climbing to the nth step, add 1 to the number of solutions
+        if (state == n)
+            res.set(0, res.get(0) + 1);
+        // Traverse all choices
+        for (Integer choice : choices) {
+            // Pruning: do not allow climbing beyond the nth step
+            if (state + choice > n)
+                continue;
+            // Attempt: make a choice, update the state
+            backtrack(choices, state + choice, n, res);
+            // Retract
+        }
+    }
+
+    /* Climbing stairs: Backtracking */
+    public static int climbingStairsBacktrack(int n) {
+        List<Integer> choices = Arrays.asList(1, 2); // Can choose to climb up 1 step or 2 steps
+        int state = 0; // Start climbing from the 0th step
+        List<Integer> res = new ArrayList<>();
+        res.add(0); // Use res[0] to record the number of solutions
+        backtrack(choices, state, n, res);
+        return res.get(0);
+    }
+
+    public static void main(String[] args) {
+        int n = 9;
+
+        int res = climbingStairsBacktrack(n);
+        System.out.println(String.format("There are %d solutions to climb %d stairs", n, res));
+    }
+}