Format: Google java formatter

Author: github-actions

DynamicProgramming/CoinChangeProblem_II/Solution.java

@@ -4,10 +4,9 @@
 
 /**
  * * Coin Change Problem II (Variation of Unbounded Knapsack Problem)
- * 
+ *
  * Problem: https://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/
  */
-
 public class Solution {
   public int minimumNumberOfCoins(int[] coins, int target) {
     // return minimumNumberOfCoinsRec(coins.length, coins, target);
@@ -22,29 +21,22 @@ public int minimumNumberOfCoins(int[] coins, int target) {
 
   /**
    * * Dynamic Programming Approach
-   * 
+   *
    * * TC: O(nt)
    * * SC: O(nt)
    */
   private int minimumNumberOfCoinsDP(int[] coins, int target) {
     int len = coins.length;
     int[][] dp = new int[len + 1][target + 1];
 
-    for (int i = 0; i < len + 1; i++)
-      dp[i][0] = 0;
+    for (int i = 0; i < len + 1; i++) dp[i][0] = 0;
 
-    for (int j = 1; j < target + 1; j++)
-      dp[0][j] = Integer.MAX_VALUE - 1;
+    for (int j = 1; j < target + 1; j++) dp[0][j] = Integer.MAX_VALUE - 1;
 
     for (int i = 1; i < len + 1; i++) {
       for (int j = 1; j < target + 1; j++) {
-        if (coins[i - 1] <= j)
-          dp[i][j] = Math.min(
-            1 + dp[i][j - coins[i - 1]],
-            dp[i - 1][j]
-          );
-        else
-          dp[i][j] = dp[i - 1][j];
+        if (coins[i - 1] <= j) dp[i][j] = Math.min(1 + dp[i][j - coins[i - 1]], dp[i - 1][j]);
+        else dp[i][j] = dp[i - 1][j];
       }
     }
 
@@ -53,7 +45,7 @@ private int minimumNumberOfCoinsDP(int[] coins, int target) {
 
   /**
    * * Memoization Approach
-   * 
+   *
    * * TC: O(nt)
    * * SC: O(nt)
    */
@@ -75,7 +67,7 @@ private int minimumNumberOfCoinsDP(int[] coins, int target) {
 
   /**
    * * Recursive Approach
-   * 
+   *
    * * TC: O(2^n) approximately
    * * SC: O(2^n) approximately
    */
@@ -101,4 +93,4 @@ public static void main(String[] args) {
     // should be 2
     System.out.println(solution.minimumNumberOfCoins(new int[] {9, 6, 5, 1}, 11));
   }
-}
+}