GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/Dynamic Programming/CoinChange.java at master · devil00/Java Expand file tree/ Copy pathCoinChange.javaMore file actions 52 lines (41 loc) · 1.39 KB / Copy pathCoinChange.javaFile metadata and controls52 lines (41 loc) · 1.39 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 /** * * @author Varun Upadhyay (https://github.com/varunu28) * */ public class CoinChange { // Driver Program public static void main(String[] args) { int amount = 12; int[] coins = {1, 2, 5}; System.out.println("Number of combinations of getting change for " + amount + " is: " + change(coins, amount)); } /** * This method finds the number of combinations of getting change for a given amount and change coins * * @param coins The list of coins * @param amount The amount for which we need to find the change * Finds the number of combinations of change **/ public static int change(int[] coins, int amount) { int[] combinations = new int[amount+1]; combinations[0] = 1; for (int coin : coins) { for (int i=coin; i<amount+1; i++) { if (i>=coin) { combinations[i] += combinations[i-coin]; } } // Uncomment the below line to see the state of combinations for each coin // printAmount(combinations); } return combinations[amount]; } // A basic print method which prints all the contents of the array public static void printAmount(int[] arr) { for (int i=0; i<arr.length; i++) { System.out.print(arr[i] + " "); } System.out.println(); } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |