(GREEDY) Find minimum number of coins
SORTED APPROACHimport java.util.*; public class Main { public static void main(String[] args) { int V = 49; ArrayList < Integer > ans = new ArrayList < > (); int coins[] = {1, 2, 5, 10, 20, 50, 100, 500, 1000}; int n = coins.length; for (int i = n - 1; i >= 0; i--) { while (V >= coins[i]) { V -= coins[i]; ans.add(coins[i]); } } System.out.println("The minimum number of coins is "+ans.size()); System.out.println("The coins are "); for (int i = 0; i < ans.size(); i++) { System.out.print(" " + ans.get(i)); } } }
Leave a Comment