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-09 14:06:06 +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,55 @@
+/**
+ * File: coin_change_greedy.java
+ * Created Time: 2023-07-20
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_greedy;
+
+import java.util.Arrays;
+
+public class coin_change_greedy {
+    /* Coin change: Greedy */
+    static int coinChangeGreedy(int[] coins, int amt) {
+        // Assume coins list is ordered
+        int i = coins.length - 1;
+        int count = 0;
+        // Loop for greedy selection until no remaining amount
+        while (amt > 0) {
+            // Find the smallest coin close to and less than the remaining amount
+            while (i > 0 && coins[i] > amt) {
+                i--;
+            }
+            // Choose coins[i]
+            amt -= coins[i];
+            count++;
+        }
+        // If no feasible solution is found, return -1
+        return amt == 0 ? count : -1;
+    }
+
+    public static void main(String[] args) {
+        // Greedy: can ensure finding a global optimal solution
+        int[] coins = { 1, 5, 10, 20, 50, 100 };
+        int amt = 186;
+        int res = coinChangeGreedy(coins, amt);
+        System.out.println("\ncoins = " + Arrays.toString(coins) + ", amt = " + amt);
+        System.out.println("The minimum number of coins required to make up " + amt + " is " + res);
+
+        // Greedy: cannot ensure finding a global optimal solution
+        coins = new int[] { 1, 20, 50 };
+        amt = 60;
+        res = coinChangeGreedy(coins, amt);
+        System.out.println("\ncoins = " + Arrays.toString(coins) + ", amt = " + amt);
+        System.out.println("The minimum number of coins required to make up " + amt + " is " + res);
+        System.out.println("In reality, the minimum number needed is 3, i.e., 20 + 20 + 20");
+
+        // Greedy: cannot ensure finding a global optimal solution
+        coins = new int[] { 1, 49, 50 };
+        amt = 98;
+        res = coinChangeGreedy(coins, amt);
+        System.out.println("\ncoins = " + Arrays.toString(coins) + ", amt = " + amt);
+        System.out.println("The minimum number of coins required to make up " + amt + " is " + res);
+        System.out.println("In reality, the minimum number needed is 2, i.e., 49 + 49");
+    }
+}