描述 | |
---|---|
知识点 | 字符串,循环,函数,指针,枚举,位运算,结构体,联合体,文件操作,递归 |
运行时间限制 | 10M |
内存限制 | 128 |
输入 | int n:n表示有多少组重量不同的砝码,1<=n<=10<><=n<=10<><=n<=10<><=n<=10<><=n<=10<><=n<=10<><=n<=10<><=n<=10<> int[] weight:表示n组砝码的重量,1<=mi<=10<><=mi<=10<><=mi<=10<><=mi<=10<><=mi<=10<><=mi<=10<><=mi<=10<><=mi<=10<> int[] num:表示n组砝码的最大数量,1<=xi<=10<><=xi<=10<><=xi<=10<><=xi<=10<><=xi<=10<><=xi<=10<><=xi<=10<><=xi<=10<> |
输出 | 利用给定的砝码可以称出的不同的重量数 |
样例输入 | 2 1 2 2 1 |
样例输出 | 5 |
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
//复制的别人的方法
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(); // 种类数
int[] weight = new int[n];// 砝码重量数组
int[] nums = new int[n]; // 砝码数量数组
Set<Integer> result = new HashSet<Integer>();// 保存可能的重量数的set
for (int i = 0; i < n; i++) {
weight[i] = sc.nextInt();
}
for (int i = 0; i < n; i++) {
nums[i] = sc.nextInt();
}
sc.close();
getWeightSet(0, 0, weight, nums, result);
System.out.println(result.size());
}
public static void getWeightSet(int curWeight, int curIndex, int[] weight,
int[] nums, Set<Integer> result) {
// 递归结束条件,当已遍历完所有砝码种类则将重量加入到集合中
if (curIndex >= weight.length) {
result.add(curWeight);
return;
}
// 递归转移方式,对当前索引的每一种可能数量递归调用该方法
for (int i = 0; i <= nums[curIndex]; i++) {
getWeightSet(curWeight + weight[curIndex] * i, curIndex + 1,
weight, nums, result);
}
}
}