递归法取硬币java_使用递归的Java硬币更改问题-不起作用

但我的计划是错误的,因为肯定有两种以上的方法可以使2磅。

public class TwoPounds

{

private static int[] coins = {1, 2, 5, 10, 20, 50, 100, 200};

private static int amount;

private static int count;

public TwoPounds()

{

amount = 2;

count = 0;

}

public static void main(String[] args)

{

TwoPounds run = new TwoPounds();

count = run.combos(amount);

run.printOut();

}

public int combos(int amountIn)

{

if (amountIn == 0)

{

return 1;

}

if (amountIn < 0)

{

return 0;

}

int combosCount = 0;

for(int i = 0; i < coins.length; i++)

{

System.out.println("amountIn now is " + amountIn);

combosCount += combos(amountIn - coins[i]);

}

return combosCount;

}

public void printOut()

{

System.out.println("\n\n\n");

System.out.println("There are " + count + " ways can 2 pounds be made, "

+ "using any number of coins");

System.out.println("\n\n\n");

}

}

There are 2 ways can 2 pounds be made, using any number of coins