forked from shuang790228/GeekTime-MathLecture-JavaCode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLesson5_1.java
More file actions
40 lines (30 loc) · 1.23 KB
/
Lesson5_1.java
File metadata and controls
40 lines (30 loc) · 1.23 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
import java.util.ArrayList;
public class Lesson5_1 {
public static long[] rewards = {1, 2, 5, 10}; // 四种面额的纸币
/**
* @Description: 使用函数的递归（嵌套）调用，找出所有可能的奖赏组合
* @param totalReward-奖赏总金额，result-保存当前的解
* @return void
*/
public static void get(long totalReward, ArrayList<Long> result) {
// 当totalReward = 0时，证明它是满足条件的解，结束嵌套调用，输出解
if (totalReward == 0) {
System.out.println(result);
return;
}
// 当totalReward < 0时，证明它不是满足条件的解，不输出
else if (totalReward < 0) {
return;
} else {
for (int i = 0; i < rewards.length; i++) {
ArrayList<Long> newResult = (ArrayList<Long>)(result.clone()); // 由于有4种情况，需要clone当前的解并传入被调用的函数
newResult.add(rewards[i]); // 记录当前的选择，解决一点问题
get(totalReward - rewards[i], newResult); // 剩下的问题，留给嵌套调用去解决
}
}
}
public static void main(String[] args) {
int totalReward = 10;
Lesson5_1.get(totalReward, new ArrayList<Long>());
}
}