質問編集履歴
5
指摘点の修正
test
CHANGED
File without changes
|
test
CHANGED
@@ -1,3 +1,75 @@
|
|
1
|
+
修正後のコード
|
2
|
+
|
3
|
+
```java
|
4
|
+
|
5
|
+
public static void create(int[][] x) {
|
6
|
+
|
7
|
+
int[][] data2;
|
8
|
+
|
9
|
+
Scanner s = new Scanner(System.in);
|
10
|
+
|
11
|
+
System.out.println("難易度を選択してください");
|
12
|
+
|
13
|
+
System.out.print("(1)簡単/(2)普通/(3)難しい");
|
14
|
+
|
15
|
+
int n = s.nextInt();
|
16
|
+
|
17
|
+
System.out.println("選択した数字は" + n + "です。");
|
18
|
+
|
19
|
+
if (n == 1) {
|
20
|
+
|
21
|
+
data2={{1,1,1,0,1,1,0,0,0},{0,0,0,1,0,0,1,0,0},{1,1,1,1,0,1,0,1,0},{0,0,0,0,1,0,0,1,0},{1,1,1,0,1,0,1,0,1},{0,0,0,0,0,1,0,0,1},{0,1,1,1,0,1,1,1,0},{7,0,0,3,0,0,0,0,0},{1,0,0,0,0,0,1,1,1}};
|
22
|
+
|
23
|
+
|
24
|
+
|
25
|
+
} else if (n == 2) {
|
26
|
+
|
27
|
+
data2={{1,0,1,0,1,1,0,0,0},{0,0,0,0,1,1,0,0,0},{0,0,0,0,0,1,0,1,1},{0,1,0,1,0,0,1,0,1},{1,0,0,0,0,0,0,0,1},{1,0,1,0,0,1,0,1,0},{1,1,0,1,0,0,0,0,0},{0,0,0,1,1,0,0,0,0},{0,0,0,1,1,0,1,0,1}};
|
28
|
+
|
29
|
+
|
30
|
+
|
31
|
+
} else if (n == 3) {
|
32
|
+
|
33
|
+
data2={{0,1,0,0,0,1,0,0,0},{1,1,1,1,0,1,0,0,0},{0,0,0,0,0,0,1,0,0},{0,0,1,0,0,0,0,1,1},{1,0,0,1,1,1,0,0,1},{1,1,0,0,0,0,1,0,0},{0,0,1,0,0,0,0,0,0},{0,0,0,1,0,1,1,1,1},{0,0,0,1,0,0,0,1,0}};
|
34
|
+
|
35
|
+
} else {
|
36
|
+
|
37
|
+
System.out.println("半角で1~3の値を入力してください。");
|
38
|
+
|
39
|
+
}
|
40
|
+
|
41
|
+
for (int i = 0; i < 9; i++) {
|
42
|
+
|
43
|
+
for (int j = 0; j < 9; j++) {
|
44
|
+
|
45
|
+
if (data2[i][j] == 0) {
|
46
|
+
|
47
|
+
data1[i][j] = 0;
|
48
|
+
|
49
|
+
}
|
50
|
+
|
51
|
+
}
|
52
|
+
|
53
|
+
}
|
54
|
+
|
55
|
+
Sub.print(data1);
|
56
|
+
|
57
|
+
}
|
58
|
+
|
59
|
+
```
|
60
|
+
|
61
|
+
ご指摘いただいたように、変数の部分を編集しました。
|
62
|
+
|
63
|
+
結果としては
|
64
|
+
|
65
|
+
・変数定数はイニシャライザーにおいてのみ使用可能です
|
66
|
+
|
67
|
+
といったエラーが表示される現状です。
|
68
|
+
|
69
|
+
|
70
|
+
|
71
|
+
|
72
|
+
|
1
73
|
現在数独の問題を作成するプログラムを作っています。
|
2
74
|
|
3
75
|
その中で、難易度選択をもうけており、それに準じた問題を作成するようにしています。
|
4
インデントの修正
test
CHANGED
File without changes
|
test
CHANGED
@@ -28,414 +28,406 @@
|
|
28
28
|
|
29
29
|
```java
|
30
30
|
|
31
|
-
public
|
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
|
-
{0,
|
58
|
-
|
59
|
-
{0,
|
60
|
-
|
61
|
-
{
|
62
|
-
|
63
|
-
|
64
|
-
|
65
|
-
|
66
|
-
|
67
|
-
|
68
|
-
|
69
|
-
|
70
|
-
|
71
|
-
|
72
|
-
|
73
|
-
|
74
|
-
|
75
|
-
|
76
|
-
|
77
|
-
|
78
|
-
|
79
|
-
|
80
|
-
|
81
|
-
|
82
|
-
|
83
|
-
|
84
|
-
|
85
|
-
|
86
|
-
|
87
|
-
|
88
|
-
|
89
|
-
|
90
|
-
|
91
|
-
|
92
|
-
|
93
|
-
|
94
|
-
|
95
|
-
|
96
|
-
|
97
|
-
|
98
|
-
|
99
|
-
|
100
|
-
|
101
|
-
|
102
|
-
|
103
|
-
|
104
|
-
|
105
|
-
|
106
|
-
|
107
|
-
|
108
|
-
|
109
|
-
|
110
|
-
|
111
|
-
|
112
|
-
|
113
|
-
|
114
|
-
|
115
|
-
|
31
|
+
public static void create(int[][] x) {
|
32
|
+
|
33
|
+
Scanner s = new Scanner(System.in);
|
34
|
+
|
35
|
+
System.out.println("難易度を選択してください");
|
36
|
+
|
37
|
+
System.out.print("(1)簡単/(2)普通/(3)難しい");
|
38
|
+
|
39
|
+
int n = s.nextInt();
|
40
|
+
|
41
|
+
System.out.println("選択した数字は" + n + "です。");
|
42
|
+
|
43
|
+
if (n == 1) {
|
44
|
+
|
45
|
+
int[][] data2 = { { 1, 1, 1, 0, 1, 1, 0, 0, 0 },
|
46
|
+
|
47
|
+
{ 0, 0, 0, 1, 0, 0, 1, 0, 0 },
|
48
|
+
|
49
|
+
{ 1, 1, 1, 1, 0, 1, 0, 1, 0 },
|
50
|
+
|
51
|
+
{ 0, 0, 0, 0, 1, 0, 0, 1, 0 },
|
52
|
+
|
53
|
+
{ 1, 1, 1, 0, 1, 0, 1, 0, 1 },
|
54
|
+
|
55
|
+
{ 0, 0, 0, 0, 0, 1, 0, 0, 1 },
|
56
|
+
|
57
|
+
{ 0, 1, 1, 1, 0, 1, 1, 1, 0 },
|
58
|
+
|
59
|
+
{ 7, 0, 0, 3, 0, 0, 0, 0, 0 },
|
60
|
+
|
61
|
+
{ 1, 0, 0, 0, 0, 0, 1, 1, 1 } };
|
62
|
+
|
63
|
+
|
64
|
+
|
65
|
+
} else if (n == 2) {
|
66
|
+
|
67
|
+
int[][] data2 = { { 1, 0, 1, 0, 1, 1, 0, 0, 0 },
|
68
|
+
|
69
|
+
{ 0, 0, 0, 0, 1, 1, 0, 0, 0 },
|
70
|
+
|
71
|
+
{ 0, 0, 0, 0, 0, 1, 0, 1, 1 },
|
72
|
+
|
73
|
+
{ 0, 1, 0, 1, 0, 0, 1, 0, 1 },
|
74
|
+
|
75
|
+
{ 1, 0, 0, 0, 0, 0, 0, 0, 1 },
|
76
|
+
|
77
|
+
{ 1, 0, 1, 0, 0, 1, 0, 1, 0 },
|
78
|
+
|
79
|
+
{ 1, 1, 0, 1, 0, 0, 0, 0, 0 },
|
80
|
+
|
81
|
+
{ 0, 0, 0, 1, 1, 0, 0, 0, 0 },
|
82
|
+
|
83
|
+
{ 0, 0, 0, 1, 1, 0, 1, 0, 1 } };
|
84
|
+
|
85
|
+
|
86
|
+
|
87
|
+
} else if (n == 3) {
|
88
|
+
|
89
|
+
int[][] data2 = { { 0, 1, 0, 0, 0, 1, 0, 0, 0 },
|
90
|
+
|
91
|
+
{ 1, 1, 1, 1, 0, 1, 0, 0, 0 },
|
92
|
+
|
93
|
+
{ 0, 0, 0, 0, 0, 0, 1, 0, 0 },
|
94
|
+
|
95
|
+
{ 0, 0, 1, 0, 0, 0, 0, 1, 1 },
|
96
|
+
|
97
|
+
{ 1, 0, 0, 1, 1, 1, 0, 0, 1 },
|
98
|
+
|
99
|
+
{ 1, 1, 0, 0, 0, 0, 1, 0, 0 },
|
100
|
+
|
101
|
+
{ 0, 0, 1, 0, 0, 0, 0, 0, 0 },
|
102
|
+
|
103
|
+
{ 0, 0, 0, 1, 0, 1, 1, 1, 1 },
|
104
|
+
|
105
|
+
{ 0, 0, 0, 1, 0, 0, 0, 1, 0 } };
|
106
|
+
|
107
|
+
} else {
|
108
|
+
|
109
|
+
System.out.println("半角で1~3の値を入力してください。");
|
110
|
+
|
111
|
+
}
|
112
|
+
|
113
|
+
for (int i = 0; i < 9; i++) {
|
114
|
+
|
115
|
+
for (int j = 0; j < 9; j++) {
|
116
|
+
|
117
|
+
if (data2[i][j] == 0) {
|
118
|
+
|
119
|
+
data1[i][j] = 0;
|
116
120
|
|
117
121
|
}
|
118
122
|
|
123
|
+
}
|
124
|
+
|
125
|
+
}
|
126
|
+
|
127
|
+
Sub.print(data1);
|
128
|
+
|
129
|
+
}
|
130
|
+
|
131
|
+
```
|
132
|
+
|
133
|
+
```ErrorMessage
|
134
|
+
|
135
|
+
Exception in thread "main" java.lang.Error: Unresolved compilation problems:
|
136
|
+
|
137
|
+
重複ローカル変数 data2
|
138
|
+
|
139
|
+
重複ローカル変数 data2
|
140
|
+
|
141
|
+
重複ローカル変数 data2
|
142
|
+
|
143
|
+
|
144
|
+
|
145
|
+
at sudoku.SudokuCreate.create(SudokuCreate.java:92)
|
146
|
+
|
147
|
+
at sudoku.SudokuCreate.placement(SudokuCreate.java:42)
|
148
|
+
|
149
|
+
at sudoku.SudokuCreate.placement(SudokuCreate.java:45)
|
150
|
+
|
151
|
+
```
|
152
|
+
|
153
|
+
|
154
|
+
|
155
|
+
以下、コード全体を記載させていただきます。
|
156
|
+
|
157
|
+
まだ、1つのクラスで書いてしまっているので、見にくくなってしまっていますが、もしよかったら見てください。
|
158
|
+
|
159
|
+
※Sub = 細々としたスクリプトが入っているクラス
|
160
|
+
|
161
|
+
```java
|
162
|
+
|
163
|
+
import java.util.Scanner;
|
164
|
+
|
165
|
+
|
166
|
+
|
167
|
+
public class SudokuCreate {
|
168
|
+
|
169
|
+
|
170
|
+
|
171
|
+
private static int[][] data1 = { { 1, 0, 0, 0, 0, 0, 0, 0, 0 },
|
172
|
+
|
173
|
+
{ 2, 0, 0, 0, 0, 0, 0, 0, 0 },
|
174
|
+
|
175
|
+
{ 3, 0, 0, 0, 0, 0, 0, 0, 0 },
|
176
|
+
|
177
|
+
{ 4, 0, 0, 0, 0, 0, 0, 0, 0 },
|
178
|
+
|
179
|
+
{ 5, 0, 0, 0, 0, 0, 0, 0, 0 },
|
180
|
+
|
181
|
+
{ 6, 0, 0, 0, 0, 0, 0, 0, 0 },
|
182
|
+
|
183
|
+
{ 7, 0, 0, 0, 0, 0, 0, 0, 0 },
|
184
|
+
|
185
|
+
{ 8, 0, 0, 0, 0, 0, 0, 0, 0 },
|
186
|
+
|
187
|
+
{ 9, 0, 0, 0, 0, 0, 0, 0, 0 } };
|
188
|
+
|
189
|
+
|
190
|
+
|
191
|
+
public static void main(String[] args) {
|
192
|
+
|
193
|
+
Sub.print(data1);
|
194
|
+
|
195
|
+
placement(data1);
|
196
|
+
|
197
|
+
}
|
198
|
+
|
199
|
+
|
200
|
+
|
201
|
+
public static void placement(int[][] data1) {
|
202
|
+
|
119
|
-
|
203
|
+
for (int i = 0; i < 9; i++) {
|
120
|
-
|
204
|
+
|
121
|
-
|
205
|
+
for (int j = 0; j < 9; j++) {
|
122
|
-
|
206
|
+
|
123
|
-
|
207
|
+
if (data1[i][j] == 0) {
|
208
|
+
|
124
|
-
|
209
|
+
int[] kl = { 0, 0, 0, 0, 0, 0, 0, 0, 0 }; //候補値を格納するための配列
|
210
|
+
|
211
|
+
cr(i, kl); //行の重複チェックメソッドを実行
|
212
|
+
|
213
|
+
cc(j, kl); //列の重複チェックメソッドを実行
|
214
|
+
|
215
|
+
cb(i, j, kl); //ブロックの重複チェックメソッドを実行
|
216
|
+
|
217
|
+
for (int k = 0; k < 9; k++) {
|
218
|
+
|
219
|
+
if (kl[k] == 0) {
|
220
|
+
|
125
|
-
data1[i][j] =
|
221
|
+
data1[i][j] = k + 1;
|
222
|
+
|
223
|
+
int count = 0;
|
224
|
+
|
225
|
+
for (int r = 0; r < 9; r++) {
|
226
|
+
|
227
|
+
for (int c = 0; c < 9; c++) {
|
228
|
+
|
229
|
+
if (data1[r][c] != 0)
|
230
|
+
|
231
|
+
count++;
|
232
|
+
|
233
|
+
}
|
126
234
|
|
127
235
|
}
|
128
236
|
|
237
|
+
if (count == 81) {
|
238
|
+
|
239
|
+
Sub.print(data1);
|
240
|
+
|
241
|
+
create(data1);
|
242
|
+
|
243
|
+
System.exit(0);
|
244
|
+
|
245
|
+
} else {
|
246
|
+
|
247
|
+
placement(data1); //値挿入後に矛盾がないかを確認
|
248
|
+
|
249
|
+
}
|
250
|
+
|
129
251
|
}
|
130
252
|
|
253
|
+
}
|
254
|
+
|
255
|
+
data1[i][j] = 0; //バックトラッキング
|
256
|
+
|
257
|
+
return;
|
258
|
+
|
131
259
|
}
|
132
260
|
|
261
|
+
}
|
262
|
+
|
263
|
+
}
|
264
|
+
|
265
|
+
}
|
266
|
+
|
267
|
+
|
268
|
+
|
269
|
+
//行の重複をチェックするメソッド
|
270
|
+
|
271
|
+
public static void cr(int r, int[] kl) {
|
272
|
+
|
273
|
+
for (int i = 0; i < 9; i++) {
|
274
|
+
|
275
|
+
if (data1[r][i] != 0) {
|
276
|
+
|
277
|
+
kl[data1[r][i] - 1] = 1;
|
278
|
+
|
279
|
+
}
|
280
|
+
|
281
|
+
}
|
282
|
+
|
283
|
+
}
|
284
|
+
|
285
|
+
|
286
|
+
|
287
|
+
//列の重複をチェックするメソッド
|
288
|
+
|
289
|
+
public static void cc(int c, int[] kl) {
|
290
|
+
|
291
|
+
for (int i = 0; i < 9; i++) {
|
292
|
+
|
293
|
+
if (data1[i][c] != 0) {
|
294
|
+
|
295
|
+
kl[data1[i][c] - 1] = 1;
|
296
|
+
|
297
|
+
}
|
298
|
+
|
299
|
+
}
|
300
|
+
|
301
|
+
}
|
302
|
+
|
303
|
+
|
304
|
+
|
305
|
+
//ブロックの重複をチェックするメソッド
|
306
|
+
|
307
|
+
public static void cb(int r, int c, int[] kl) {
|
308
|
+
|
309
|
+
int sr = r / 3 * 3;
|
310
|
+
|
311
|
+
int sc = c / 3 * 3;
|
312
|
+
|
313
|
+
for (int s = sr; s < sr + 3; s++) {
|
314
|
+
|
315
|
+
for (int b = sc; b < sc + 3; b++) {
|
316
|
+
|
317
|
+
if (data1[s][b] != 0)
|
318
|
+
|
319
|
+
kl[data1[s][b] - 1] = 1;
|
320
|
+
|
321
|
+
}
|
322
|
+
|
323
|
+
}
|
324
|
+
|
325
|
+
}
|
326
|
+
|
327
|
+
|
328
|
+
|
329
|
+
public static void create(int[][] x) {
|
330
|
+
|
331
|
+
Scanner s = new Scanner(System.in);
|
332
|
+
|
333
|
+
System.out.println("難易度を選択してください");
|
334
|
+
|
335
|
+
System.out.print("(1)簡単/(2)普通/(3)難しい");
|
336
|
+
|
337
|
+
int n = s.nextInt();
|
338
|
+
|
339
|
+
System.out.println("選択した数字は" + n + "です。");
|
340
|
+
|
341
|
+
if (n == 1) {
|
342
|
+
|
343
|
+
int[][] data2 = { { 1, 1, 1, 0, 1, 1, 0, 0, 0 },
|
344
|
+
|
345
|
+
{ 0, 0, 0, 1, 0, 0, 1, 0, 0 },
|
346
|
+
|
347
|
+
{ 1, 1, 1, 1, 0, 1, 0, 1, 0 },
|
348
|
+
|
349
|
+
{ 0, 0, 0, 0, 1, 0, 0, 1, 0 },
|
350
|
+
|
351
|
+
{ 1, 1, 1, 0, 1, 0, 1, 0, 1 },
|
352
|
+
|
353
|
+
{ 0, 0, 0, 0, 0, 1, 0, 0, 1 },
|
354
|
+
|
355
|
+
{ 0, 1, 1, 1, 0, 1, 1, 1, 0 },
|
356
|
+
|
357
|
+
{ 7, 0, 0, 3, 0, 0, 0, 0, 0 },
|
358
|
+
|
359
|
+
{ 1, 0, 0, 0, 0, 0, 1, 1, 1 } };
|
360
|
+
|
361
|
+
|
362
|
+
|
363
|
+
} else if (n == 2) {
|
364
|
+
|
365
|
+
int[][] data2 = { { 1, 0, 1, 0, 1, 1, 0, 0, 0 },
|
366
|
+
|
367
|
+
{ 0, 0, 0, 0, 1, 1, 0, 0, 0 },
|
368
|
+
|
369
|
+
{ 0, 0, 0, 0, 0, 1, 0, 1, 1 },
|
370
|
+
|
371
|
+
{ 0, 1, 0, 1, 0, 0, 1, 0, 1 },
|
372
|
+
|
373
|
+
{ 1, 0, 0, 0, 0, 0, 0, 0, 1 },
|
374
|
+
|
375
|
+
{ 1, 0, 1, 0, 0, 1, 0, 1, 0 },
|
376
|
+
|
377
|
+
{ 1, 1, 0, 1, 0, 0, 0, 0, 0 },
|
378
|
+
|
379
|
+
{ 0, 0, 0, 1, 1, 0, 0, 0, 0 },
|
380
|
+
|
381
|
+
{ 0, 0, 0, 1, 1, 0, 1, 0, 1 } };
|
382
|
+
|
383
|
+
|
384
|
+
|
385
|
+
} else if (n == 3) {
|
386
|
+
|
387
|
+
int[][] data2 = { { 0, 1, 0, 0, 0, 1, 0, 0, 0 },
|
388
|
+
|
389
|
+
{ 1, 1, 1, 1, 0, 1, 0, 0, 0 },
|
390
|
+
|
391
|
+
{ 0, 0, 0, 0, 0, 0, 1, 0, 0 },
|
392
|
+
|
393
|
+
{ 0, 0, 1, 0, 0, 0, 0, 1, 1 },
|
394
|
+
|
395
|
+
{ 1, 0, 0, 1, 1, 1, 0, 0, 1 },
|
396
|
+
|
397
|
+
{ 1, 1, 0, 0, 0, 0, 1, 0, 0 },
|
398
|
+
|
399
|
+
{ 0, 0, 1, 0, 0, 0, 0, 0, 0 },
|
400
|
+
|
401
|
+
{ 0, 0, 0, 1, 0, 1, 1, 1, 1 },
|
402
|
+
|
403
|
+
{ 0, 0, 0, 1, 0, 0, 0, 1, 0 } };
|
404
|
+
|
405
|
+
} else {
|
406
|
+
|
407
|
+
System.out.println("正しい値を入力してください。");
|
408
|
+
|
409
|
+
}
|
410
|
+
|
411
|
+
for (int i = 0; i < 9; i++) {
|
412
|
+
|
413
|
+
for (int j = 0; j < 9; j++) {
|
414
|
+
|
415
|
+
if (data2[i][j] == 0) {
|
416
|
+
|
417
|
+
data1[i][j] = 0;
|
418
|
+
|
419
|
+
}
|
420
|
+
|
421
|
+
}
|
422
|
+
|
423
|
+
}
|
424
|
+
|
133
|
-
|
425
|
+
Sub.print(data1);
|
134
|
-
|
426
|
+
|
135
|
-
|
427
|
+
}
|
428
|
+
|
429
|
+
}
|
430
|
+
|
431
|
+
|
136
432
|
|
137
433
|
```
|
138
|
-
|
139
|
-
```ErrorMessage
|
140
|
-
|
141
|
-
Exception in thread "main" java.lang.Error: Unresolved compilation problems:
|
142
|
-
|
143
|
-
重複ローカル変数 data2
|
144
|
-
|
145
|
-
重複ローカル変数 data2
|
146
|
-
|
147
|
-
重複ローカル変数 data2
|
148
|
-
|
149
|
-
|
150
|
-
|
151
|
-
at sudoku.SudokuCreate.create(SudokuCreate.java:92)
|
152
|
-
|
153
|
-
at sudoku.SudokuCreate.placement(SudokuCreate.java:42)
|
154
|
-
|
155
|
-
at sudoku.SudokuCreate.placement(SudokuCreate.java:45)
|
156
|
-
|
157
|
-
```
|
158
|
-
|
159
|
-
|
160
|
-
|
161
|
-
以下、コード全体を記載させていただきます。
|
162
|
-
|
163
|
-
まだ、1つのクラスで書いてしまっているので、見にくくなってしまっていますが、もしよかったら見てください。
|
164
|
-
|
165
|
-
※Sub = 細々としたスクリプトが入っているクラス
|
166
|
-
|
167
|
-
```java
|
168
|
-
|
169
|
-
import java.util.Scanner;
|
170
|
-
|
171
|
-
public class SudokuCreate {
|
172
|
-
|
173
|
-
|
174
|
-
|
175
|
-
private static int[][] data1 =
|
176
|
-
|
177
|
-
{{1,0,0,0,0,0,0,0,0},
|
178
|
-
|
179
|
-
{2,0,0,0,0,0,0,0,0},
|
180
|
-
|
181
|
-
{3,0,0,0,0,0,0,0,0},
|
182
|
-
|
183
|
-
{4,0,0,0,0,0,0,0,0},
|
184
|
-
|
185
|
-
{5,0,0,0,0,0,0,0,0},
|
186
|
-
|
187
|
-
{6,0,0,0,0,0,0,0,0},
|
188
|
-
|
189
|
-
{7,0,0,0,0,0,0,0,0},
|
190
|
-
|
191
|
-
{8,0,0,0,0,0,0,0,0},
|
192
|
-
|
193
|
-
{9,0,0,0,0,0,0,0,0}};
|
194
|
-
|
195
|
-
|
196
|
-
|
197
|
-
public static void main(String[] args) {
|
198
|
-
|
199
|
-
Sub.print(data1);
|
200
|
-
|
201
|
-
placement(data1);
|
202
|
-
|
203
|
-
}
|
204
|
-
|
205
|
-
public static void placement(int[][]data1) {
|
206
|
-
|
207
|
-
for(int i = 0; i < 9; i++) {
|
208
|
-
|
209
|
-
for(int j = 0; j < 9; j++) {
|
210
|
-
|
211
|
-
if(data1[i][j] == 0) {
|
212
|
-
|
213
|
-
int[] kl = {0,0,0,0,0,0,0,0,0}; //候補値を格納するための配列
|
214
|
-
|
215
|
-
cr(i, kl); //行の重複チェックメソッドを実行
|
216
|
-
|
217
|
-
cc (j, kl); //列の重複チェックメソッドを実行
|
218
|
-
|
219
|
-
cb(i, j, kl); //ブロックの重複チェックメソッドを実行
|
220
|
-
|
221
|
-
for(int k = 0; k < 9; k++) {
|
222
|
-
|
223
|
-
if(kl[k] == 0) {
|
224
|
-
|
225
|
-
data1[i][j] = k + 1;
|
226
|
-
|
227
|
-
int count = 0;
|
228
|
-
|
229
|
-
for(int r = 0; r < 9; r++) {
|
230
|
-
|
231
|
-
for(int c = 0; c < 9; c++) {
|
232
|
-
|
233
|
-
if(data1[r][c] != 0)
|
234
|
-
|
235
|
-
count++;
|
236
|
-
|
237
|
-
}
|
238
|
-
|
239
|
-
}
|
240
|
-
|
241
|
-
if(count == 81) {
|
242
|
-
|
243
|
-
Sub.print(data1);
|
244
|
-
|
245
|
-
create(data1);
|
246
|
-
|
247
|
-
System.exit(0);
|
248
|
-
|
249
|
-
} else {
|
250
|
-
|
251
|
-
placement(data1); //値挿入後に矛盾がないかを確認
|
252
|
-
|
253
|
-
}
|
254
|
-
|
255
|
-
}
|
256
|
-
|
257
|
-
}
|
258
|
-
|
259
|
-
data1[i][j] = 0; //バックトラッキング
|
260
|
-
|
261
|
-
return;
|
262
|
-
|
263
|
-
}
|
264
|
-
|
265
|
-
}
|
266
|
-
|
267
|
-
}
|
268
|
-
|
269
|
-
}
|
270
|
-
|
271
|
-
//行の重複をチェックするメソッド
|
272
|
-
|
273
|
-
public static void cr(int r, int[] kl) {
|
274
|
-
|
275
|
-
for(int i = 0; i < 9; i++) {
|
276
|
-
|
277
|
-
if(data1[r][i] != 0) {
|
278
|
-
|
279
|
-
kl[data1[r][i] -1] = 1;
|
280
|
-
|
281
|
-
}
|
282
|
-
|
283
|
-
}
|
284
|
-
|
285
|
-
}
|
286
|
-
|
287
|
-
|
288
|
-
|
289
|
-
//列の重複をチェックするメソッド
|
290
|
-
|
291
|
-
public static void cc(int c, int[] kl) {
|
292
|
-
|
293
|
-
for(int i = 0; i < 9; i++) {
|
294
|
-
|
295
|
-
if(data1[i][c] != 0) {
|
296
|
-
|
297
|
-
kl[data1[i][c] -1] = 1;
|
298
|
-
|
299
|
-
}
|
300
|
-
|
301
|
-
}
|
302
|
-
|
303
|
-
}
|
304
|
-
|
305
|
-
|
306
|
-
|
307
|
-
//ブロックの重複をチェックするメソッド
|
308
|
-
|
309
|
-
public static void cb(int r, int c,int[] kl) {
|
310
|
-
|
311
|
-
int sr = r / 3 * 3;
|
312
|
-
|
313
|
-
int sc = c / 3 * 3;
|
314
|
-
|
315
|
-
for(int s = sr; s < sr + 3; s++) {
|
316
|
-
|
317
|
-
for(int b = sc; b < sc + 3; b++) {
|
318
|
-
|
319
|
-
if(data1[s][b] != 0)
|
320
|
-
|
321
|
-
kl[data1[s][b] -1] = 1;
|
322
|
-
|
323
|
-
}
|
324
|
-
|
325
|
-
}
|
326
|
-
|
327
|
-
}
|
328
|
-
|
329
|
-
|
330
|
-
|
331
|
-
public static void create (int[][] data1) {
|
332
|
-
|
333
|
-
Scanner s = new Scanner(System.in);
|
334
|
-
|
335
|
-
System.out.println("難易度を選択してください");
|
336
|
-
|
337
|
-
System.out.print("(1)簡単/(2)普通/(3)難しい");
|
338
|
-
|
339
|
-
int n = s.nextInt();
|
340
|
-
|
341
|
-
System.out.println("選択した数字は" + n + "です。");
|
342
|
-
|
343
|
-
if (n == 1) {
|
344
|
-
|
345
|
-
int[][] data2=
|
346
|
-
|
347
|
-
{{1,1,1,0,1,1,0,0,0},
|
348
|
-
|
349
|
-
{0,0,0,1,0,0,1,0,0},
|
350
|
-
|
351
|
-
{1,1,1,1,0,1,0,1,0},
|
352
|
-
|
353
|
-
{0,0,0,0,1,0,0,1,0},
|
354
|
-
|
355
|
-
{1,1,1,0,1,0,1,0,1},
|
356
|
-
|
357
|
-
{0,0,0,0,0,1,0,0,1},
|
358
|
-
|
359
|
-
{0,1,1,1,0,1,1,1,0},
|
360
|
-
|
361
|
-
{7,0,0,3,0,0,0,0,0},
|
362
|
-
|
363
|
-
{1,0,0,0,0,0,1,1,1}};
|
364
|
-
|
365
|
-
|
366
|
-
|
367
|
-
} else if (n == 2) {
|
368
|
-
|
369
|
-
int[][] data2 =
|
370
|
-
|
371
|
-
{{1,0,1,0,1,1,0,0,0},
|
372
|
-
|
373
|
-
{0,0,0,0,1,1,0,0,0},
|
374
|
-
|
375
|
-
{0,0,0,0,0,1,0,1,1},
|
376
|
-
|
377
|
-
{0,1,0,1,0,0,1,0,1},
|
378
|
-
|
379
|
-
{1,0,0,0,0,0,0,0,1},
|
380
|
-
|
381
|
-
{1,0,1,0,0,1,0,1,0},
|
382
|
-
|
383
|
-
{1,1,0,1,0,0,0,0,0},
|
384
|
-
|
385
|
-
{0,0,0,1,1,0,0,0,0},
|
386
|
-
|
387
|
-
{0,0,0,1,1,0,1,0,1}};
|
388
|
-
|
389
|
-
|
390
|
-
|
391
|
-
}else if (n == 3){
|
392
|
-
|
393
|
-
int[][] data2 =
|
394
|
-
|
395
|
-
{{0,1,0,0,0,1,0,0,0},
|
396
|
-
|
397
|
-
{1,1,1,1,0,1,0,0,0},
|
398
|
-
|
399
|
-
{0,0,0,0,0,0,1,0,0},
|
400
|
-
|
401
|
-
{0,0,1,0,0,0,0,1,1},
|
402
|
-
|
403
|
-
{1,0,0,1,1,1,0,0,1},
|
404
|
-
|
405
|
-
{1,1,0,0,0,0,1,0,0},
|
406
|
-
|
407
|
-
{0,0,1,0,0,0,0,0,0},
|
408
|
-
|
409
|
-
{0,0,0,1,0,1,1,1,1},
|
410
|
-
|
411
|
-
{0,0,0,1,0,0,0,1,0}};
|
412
|
-
|
413
|
-
|
414
|
-
|
415
|
-
} else {
|
416
|
-
|
417
|
-
System.out.println("正しい値を入力してください。");
|
418
|
-
|
419
|
-
}
|
420
|
-
|
421
|
-
for(int i = 0; i < 9; i++) {
|
422
|
-
|
423
|
-
for(int j = 0; j < 9; j++) {
|
424
|
-
|
425
|
-
if(data2 [i][j] == 0){
|
426
|
-
|
427
|
-
data1[i][j] = 0;
|
428
|
-
|
429
|
-
}
|
430
|
-
|
431
|
-
}
|
432
|
-
|
433
|
-
}
|
434
|
-
|
435
|
-
Sub.print(data1);
|
436
|
-
|
437
|
-
}
|
438
|
-
|
439
|
-
}
|
440
|
-
|
441
|
-
```
|
3
指摘を頂いた点を修正
test
CHANGED
File without changes
|
test
CHANGED
@@ -46,7 +46,7 @@
|
|
46
46
|
|
47
47
|
{{1,1,1,0,1,1,0,0,0},
|
48
48
|
|
49
|
-
|
49
|
+
{0,0,0,1,0,0,1,0,0},
|
50
50
|
|
51
51
|
{1,1,1,1,0,1,0,1,0},
|
52
52
|
|
@@ -68,23 +68,23 @@
|
|
68
68
|
|
69
69
|
int[][] data2 =
|
70
70
|
|
71
|
-
|
71
|
+
{{1,0,1,0,1,1,0,0,0},
|
72
|
-
|
72
|
+
|
73
|
-
|
73
|
+
{0,0,0,0,1,1,0,0,0},
|
74
|
-
|
74
|
+
|
75
|
-
|
75
|
+
{0,0,0,0,0,1,0,1,1},
|
76
|
-
|
76
|
+
|
77
|
-
|
77
|
+
{0,1,0,1,0,0,1,0,1},
|
78
|
-
|
78
|
+
|
79
|
-
|
79
|
+
{1,0,0,0,0,0,0,0,1},
|
80
|
-
|
80
|
+
|
81
|
-
|
81
|
+
{1,0,1,0,0,1,0,1,0},
|
82
|
-
|
82
|
+
|
83
|
-
|
83
|
+
{1,1,0,1,0,0,0,0,0},
|
84
|
-
|
84
|
+
|
85
|
-
|
85
|
+
{0,0,0,1,1,0,0,0,0},
|
86
|
-
|
86
|
+
|
87
|
-
|
87
|
+
{0,0,0,1,1,0,1,0,1}};
|
88
88
|
|
89
89
|
|
90
90
|
|
@@ -92,23 +92,23 @@
|
|
92
92
|
|
93
93
|
int[][] data2 =
|
94
94
|
|
95
|
-
|
95
|
+
{{0,1,0,0,0,1,0,0,0},
|
96
|
-
|
96
|
+
|
97
|
-
|
97
|
+
{1,1,1,1,0,1,0,0,0},
|
98
|
-
|
98
|
+
|
99
|
-
|
99
|
+
{0,0,0,0,0,0,1,0,0},
|
100
|
-
|
100
|
+
|
101
|
-
|
101
|
+
{0,0,1,0,0,0,0,1,1},
|
102
|
-
|
102
|
+
|
103
|
-
|
103
|
+
{1,0,0,1,1,1,0,0,1},
|
104
|
-
|
104
|
+
|
105
|
-
|
105
|
+
{1,1,0,0,0,0,1,0,0},
|
106
|
-
|
106
|
+
|
107
|
-
|
107
|
+
{0,0,1,0,0,0,0,0,0},
|
108
|
-
|
108
|
+
|
109
|
-
|
109
|
+
{0,0,0,1,0,1,1,1,1},
|
110
|
-
|
110
|
+
|
111
|
-
|
111
|
+
{0,0,0,1,0,0,0,1,0}};
|
112
112
|
|
113
113
|
} else {
|
114
114
|
|
@@ -344,9 +344,9 @@
|
|
344
344
|
|
345
345
|
int[][] data2=
|
346
346
|
|
347
|
-
|
347
|
+
{{1,1,1,0,1,1,0,0,0},
|
348
|
-
|
348
|
+
|
349
|
-
|
349
|
+
{0,0,0,1,0,0,1,0,0},
|
350
350
|
|
351
351
|
{1,1,1,1,0,1,0,1,0},
|
352
352
|
|
@@ -358,7 +358,7 @@
|
|
358
358
|
|
359
359
|
{0,1,1,1,0,1,1,1,0},
|
360
360
|
|
361
|
-
{
|
361
|
+
{7,0,0,3,0,0,0,0,0},
|
362
362
|
|
363
363
|
{1,0,0,0,0,0,1,1,1}};
|
364
364
|
|
@@ -368,23 +368,23 @@
|
|
368
368
|
|
369
369
|
int[][] data2 =
|
370
370
|
|
371
|
-
|
371
|
+
{{1,0,1,0,1,1,0,0,0},
|
372
|
-
|
372
|
+
|
373
|
-
|
373
|
+
{0,0,0,0,1,1,0,0,0},
|
374
|
-
|
374
|
+
|
375
|
-
|
375
|
+
{0,0,0,0,0,1,0,1,1},
|
376
|
-
|
376
|
+
|
377
|
-
|
377
|
+
{0,1,0,1,0,0,1,0,1},
|
378
|
-
|
378
|
+
|
379
|
-
|
379
|
+
{1,0,0,0,0,0,0,0,1},
|
380
|
-
|
380
|
+
|
381
|
-
|
381
|
+
{1,0,1,0,0,1,0,1,0},
|
382
|
-
|
382
|
+
|
383
|
-
|
383
|
+
{1,1,0,1,0,0,0,0,0},
|
384
|
-
|
384
|
+
|
385
|
-
|
385
|
+
{0,0,0,1,1,0,0,0,0},
|
386
|
-
|
386
|
+
|
387
|
-
|
387
|
+
{0,0,0,1,1,0,1,0,1}};
|
388
388
|
|
389
389
|
|
390
390
|
|
@@ -392,23 +392,25 @@
|
|
392
392
|
|
393
393
|
int[][] data2 =
|
394
394
|
|
395
|
-
|
395
|
+
{{0,1,0,0,0,1,0,0,0},
|
396
|
-
|
396
|
+
|
397
|
-
|
397
|
+
{1,1,1,1,0,1,0,0,0},
|
398
|
-
|
398
|
+
|
399
|
-
|
399
|
+
{0,0,0,0,0,0,1,0,0},
|
400
|
-
|
400
|
+
|
401
|
-
|
401
|
+
{0,0,1,0,0,0,0,1,1},
|
402
|
-
|
402
|
+
|
403
|
-
|
403
|
+
{1,0,0,1,1,1,0,0,1},
|
404
|
-
|
404
|
+
|
405
|
-
|
405
|
+
{1,1,0,0,0,0,1,0,0},
|
406
|
-
|
406
|
+
|
407
|
-
|
407
|
+
{0,0,1,0,0,0,0,0,0},
|
408
|
-
|
408
|
+
|
409
|
-
|
409
|
+
{0,0,0,1,0,1,1,1,1},
|
410
|
-
|
410
|
+
|
411
|
-
|
411
|
+
{0,0,0,1,0,0,0,1,0}};
|
412
|
+
|
413
|
+
|
412
414
|
|
413
415
|
} else {
|
414
416
|
|
2
指摘いただいた、引数の問題を修正
test
CHANGED
File without changes
|
test
CHANGED
@@ -44,23 +44,23 @@
|
|
44
44
|
|
45
45
|
int[][] data2=
|
46
46
|
|
47
|
-
|
47
|
+
{{1,1,1,0,1,1,0,0,0},
|
48
|
-
|
48
|
+
|
49
|
-
|
49
|
+
{0,0,0,1,0,0,1,0,0},
|
50
|
-
|
50
|
+
|
51
|
-
|
51
|
+
{1,1,1,1,0,1,0,1,0},
|
52
|
-
|
52
|
+
|
53
|
-
|
53
|
+
{0,0,0,0,1,0,0,1,0},
|
54
|
-
|
54
|
+
|
55
|
-
|
55
|
+
{1,1,1,0,1,0,1,0,1},
|
56
|
-
|
56
|
+
|
57
|
-
|
57
|
+
{0,0,0,0,0,1,0,0,1},
|
58
|
-
|
58
|
+
|
59
|
-
|
59
|
+
{0,1,1,1,0,1,1,1,0},
|
60
|
-
|
60
|
+
|
61
|
-
|
61
|
+
{7,0,0,3,0,0,0,0,0},
|
62
|
-
|
62
|
+
|
63
|
-
|
63
|
+
{1,0,0,0,0,0,1,1,1}};
|
64
64
|
|
65
65
|
|
66
66
|
|
@@ -68,7 +68,7 @@
|
|
68
68
|
|
69
69
|
int[][] data2 =
|
70
70
|
|
71
|
-
{{1,0,1,0,1,1,0,0,0},
|
71
|
+
{{1,0,1,0,1,1,0,0,0},
|
72
72
|
|
73
73
|
{0,0,0,0,1,1,0,0,0},
|
74
74
|
|
@@ -94,7 +94,7 @@
|
|
94
94
|
|
95
95
|
{{0,1,0,0,0,1,0,0,0},
|
96
96
|
|
97
|
-
|
97
|
+
{1,1,1,1,0,1,0,0,0},
|
98
98
|
|
99
99
|
{0,0,0,0,0,0,1,0,0},
|
100
100
|
|
@@ -106,9 +106,9 @@
|
|
106
106
|
|
107
107
|
{0,0,1,0,0,0,0,0,0},
|
108
108
|
|
109
|
-
{0,0,0,1,0,1,1,1,1},
|
109
|
+
{0,0,0,1,0,1,1,1,1},
|
110
|
-
|
110
|
+
|
111
|
-
{0,0,0,1,0,0,0,1,0}};
|
111
|
+
{0,0,0,1,0,0,0,1,0}};
|
112
112
|
|
113
113
|
} else {
|
114
114
|
|
@@ -328,7 +328,7 @@
|
|
328
328
|
|
329
329
|
|
330
330
|
|
331
|
-
public static void create (int[][] data1
|
331
|
+
public static void create (int[][] data1) {
|
332
332
|
|
333
333
|
Scanner s = new Scanner(System.in);
|
334
334
|
|
@@ -344,23 +344,23 @@
|
|
344
344
|
|
345
345
|
int[][] data2=
|
346
346
|
|
347
|
-
|
347
|
+
{{1,1,1,0,1,1,0,0,0},
|
348
|
-
|
348
|
+
|
349
|
-
|
349
|
+
{0,0,0,1,0,0,1,0,0},
|
350
|
-
|
350
|
+
|
351
|
-
|
351
|
+
{1,1,1,1,0,1,0,1,0},
|
352
|
-
|
352
|
+
|
353
|
-
|
353
|
+
{0,0,0,0,1,0,0,1,0},
|
354
|
-
|
354
|
+
|
355
|
-
|
355
|
+
{1,1,1,0,1,0,1,0,1},
|
356
|
-
|
356
|
+
|
357
|
-
|
357
|
+
{0,0,0,0,0,1,0,0,1},
|
358
|
-
|
358
|
+
|
359
|
-
|
359
|
+
{0,1,1,1,0,1,1,1,0},
|
360
|
-
|
360
|
+
|
361
|
-
|
361
|
+
{1,0,0,1,0,0,0,0,0},
|
362
|
-
|
362
|
+
|
363
|
-
|
363
|
+
{1,0,0,0,0,0,1,1,1}};
|
364
364
|
|
365
365
|
|
366
366
|
|
@@ -368,7 +368,7 @@
|
|
368
368
|
|
369
369
|
int[][] data2 =
|
370
370
|
|
371
|
-
{{1,0,1,0,1,1,0,0,0},
|
371
|
+
{{1,0,1,0,1,1,0,0,0},
|
372
372
|
|
373
373
|
{0,0,0,0,1,1,0,0,0},
|
374
374
|
|
@@ -394,7 +394,7 @@
|
|
394
394
|
|
395
395
|
{{0,1,0,0,0,1,0,0,0},
|
396
396
|
|
397
|
-
{1,1,1,1,0,1,0,0,0},
|
397
|
+
{1,1,1,1,0,1,0,0,0},
|
398
398
|
|
399
399
|
{0,0,0,0,0,0,1,0,0},
|
400
400
|
|
@@ -406,9 +406,9 @@
|
|
406
406
|
|
407
407
|
{0,0,1,0,0,0,0,0,0},
|
408
408
|
|
409
|
-
{0,0,0,1,0,1,1,1,1},
|
409
|
+
{0,0,0,1,0,1,1,1,1},
|
410
|
-
|
410
|
+
|
411
|
-
{0,0,0,1,0,0,0,1,0}};
|
411
|
+
{0,0,0,1,0,0,0,1,0}};
|
412
412
|
|
413
413
|
} else {
|
414
414
|
|
1
ご指摘いただいた、引数の修正。うまくいっていない箇所の修正
test
CHANGED
File without changes
|
test
CHANGED
@@ -14,6 +14,8 @@
|
|
14
14
|
|
15
15
|
・scannerの部分を飛ばし、if文にいきなり入る。
|
16
16
|
|
17
|
+
・for文内のdata2とif文内のdata2が別物の扱いを受ける
|
18
|
+
|
17
19
|
|
18
20
|
|
19
21
|
この対処法がわからずに困っております。
|
@@ -26,7 +28,7 @@
|
|
26
28
|
|
27
29
|
```java
|
28
30
|
|
29
|
-
public static void create (int[][] data1
|
31
|
+
public static void create (int[][] data1) {
|
30
32
|
|
31
33
|
Scanner s = new Scanner(System.in);
|
32
34
|
|
@@ -190,9 +192,7 @@
|
|
190
192
|
|
191
193
|
{9,0,0,0,0,0,0,0,0}};
|
192
194
|
|
193
|
-
|
195
|
+
|
194
|
-
|
195
|
-
|
196
196
|
|
197
197
|
public static void main(String[] args) {
|
198
198
|
|
@@ -242,7 +242,7 @@
|
|
242
242
|
|
243
243
|
Sub.print(data1);
|
244
244
|
|
245
|
-
create(data1
|
245
|
+
create(data1);
|
246
246
|
|
247
247
|
System.exit(0);
|
248
248
|
|