java最少钱币数_不限硬币数量的最少硬币问题(递归算法)

代码如下:

import java.util.Scanner;

class Main

{

static int x,y,z; //x是硬币种数,y是需要凑成的金额数,z是所需硬币数,a是硬币面值数组

static int[] a;

static int coin(int g) //输入数为需要凑成的金额数,返回数为所需要的硬币数

{

int i;

for(i=1;i<=x;i++)

{

if(g>a[x-i])

{

int b=coin(g-a[x-i]);

if (b!=-1)

return 1+b;

}

else if (g==a[x-i])

return 1;

}

return -1;

}

public static void main(String[] args)

{

Scanner reader = new Scanner(System.in);

int p;

x = reader.nextInt();

a = new int[x];

for (int i=0;i

a[i] = reader.nextInt();

y = reader.nextInt();

if (y<=0)

{

System.out.println(-1);

System.exit(0);

}

for (int i=0;i

{

for(int n=0;n

{

if (a[n]>a[n+1])

{

p = a[n+1];

a[n+1] = a[n];

a[n] = p;

}

}

}

z = coin(y);

System.out.println(z);

}

}