動態規划經典問題Java實現

動態規划問題Java實現

如果我們有面值為1元、3元和5元的硬幣若干枚，如何用最少的硬幣湊夠11元？

    public class DPProblem {  
         
        public static void main(String[] args) {  
            int[] cons = new int[12];  
            for (int i = 1; i <= 11; i++) {  
                int cons1 = i - 1;  
                int cons3 = i - 3;  
                int cons5 = i - 5;  
                int minCons = cons[cons1];  
                int lastCons = cons1;  
                if(cons3>=0 && cons[cons3] < minCons){  
                    minCons = cons[cons3];  
                    lastCons = cons3;  
                }  
                if(cons5>=0 && cons[cons5]<minCons){  
                    minCons = cons[cons5];  
                    lastCons = cons5;  
                }  
                  
                cons[i]=minCons+1;  
                  
                System.out.println(i+":"+cons[i]);  
            }  
        }  
    }