-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCalculateChain.java
More file actions
81 lines (70 loc) · 1.59 KB
/
CalculateChain.java
File metadata and controls
81 lines (70 loc) · 1.59 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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
public class CalculateChain {
int next[];
int sub[][] = new int[GlobalVal.height][GlobalVal.width];
public CalculateChain(int chainNum) {
next = new int[GlobalVal.nextTsumo.size() / 2];
boolean finish = true;
Put p = new Put();
Input();
while (finish) {
finish = false;
Next();
for (int i = 0; i < (GlobalVal.nextTsumo.size() / 2); i++) {
GlobalVal.p[0][3] = GlobalVal.nextTsumo.get(i * 2);
GlobalVal.p[1][3] = GlobalVal.nextTsumo.get(i * 2 + 1);
p.put(next[i], false);
}
if (Check(chainNum)) {
for (int i : next)
GlobalVal.success.add(i);
Output();
break;
} else
Output();
// ループ終了条件
for (int i : next) {
if (i < 21)
finish = true;
}
}
}
public void Next() {
next[0]++;
for (int i = 0; i < next.length - 1; i++) {
if (next[i] > 21) {
next[i] = 0;
next[i + 1]++;
}
}
}
public void Input() {
for (int i1 = 0; i1 < GlobalVal.height; i1++) {
for (int i2 = 0; i2 < GlobalVal.width; i2++)
sub[i1][i2] = GlobalVal.p[i1][i2];
}
}
public void Output() {
for (int i1 = 0; i1 < GlobalVal.height; i1++) {
for (int i2 = 0; i2 < GlobalVal.width; i2++)
GlobalVal.p[i1][i2] = sub[i1][i2];
}
}
public boolean Check(int chainNum) {
boolean check = true;
if (chainNum == 0) {
for (int i1 = 0; i1 < GlobalVal.height; i1++) {
for (int i2 = 0; i2 < GlobalVal.width; i2++) {
if (GlobalVal.p[i1][i2] != 0)
check = false;
}
}
} else {
if (GlobalVal.chainNum < chainNum)
check = false;
}
if (check) {
return true;
} else
return false;
}
}