-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSudokuSolverTest.java
More file actions
136 lines (123 loc) · 5.15 KB
/
Copy pathSudokuSolverTest.java
File metadata and controls
136 lines (123 loc) · 5.15 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
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
package uk.jasonng.algoexpert.recursion;
import org.junit.Test;
import java.util.Arrays;
import static org.junit.Assert.assertTrue;
public class SudokuSolverTest {
private SudokuSolver sudokuSolver = new SudokuSolver();
@Test
public void TestCase1() {
int[][] inputValues =
new int[][]{
{7, 8, 0, 4, 0, 0, 1, 2, 0},
{6, 0, 0, 0, 7, 5, 0, 0, 9},
{0, 0, 0, 6, 0, 1, 0, 7, 8},
{0, 0, 7, 0, 4, 0, 2, 6, 0},
{0, 0, 1, 0, 5, 0, 9, 3, 0},
{9, 0, 4, 0, 6, 0, 0, 0, 5},
{0, 7, 0, 3, 0, 0, 0, 1, 2},
{1, 2, 0, 0, 0, 7, 4, 0, 0},
{0, 4, 9, 2, 0, 6, 0, 0, 7}
};
int[][] expectedValues =
new int[][]{
{7, 8, 5, 4, 3, 9, 1, 2, 6},
{6, 1, 2, 8, 7, 5, 3, 4, 9},
{4, 9, 3, 6, 2, 1, 5, 7, 8},
{8, 5, 7, 9, 4, 3, 2, 6, 1},
{2, 6, 1, 7, 5, 8, 9, 3, 4},
{9, 3, 4, 1, 6, 2, 7, 8, 5},
{5, 7, 8, 3, 9, 4, 6, 1, 2},
{1, 2, 6, 5, 8, 7, 4, 9, 3},
{3, 4, 9, 2, 1, 6, 8, 5, 7}
};
checkResults(inputValues, expectedValues);
}
@Test
public void TestCase2() {
int[][] inputValues =
new int[][]{
{0, 0, 0, 0, 3, 0, 0, 0, 9},
{0, 4, 0, 5, 0, 0, 0, 7, 8},
{2, 9, 0, 0, 0, 1, 0, 5, 0},
{0, 7, 8, 0, 0, 3, 0, 0, 6},
{0, 3, 0, 0, 6, 0, 0, 8, 0},
{6, 0, 0, 8, 0, 0, 9, 3, 0},
{0, 6, 0, 9, 0, 0, 0, 2, 7},
{7, 2, 0, 0, 0, 5, 0, 6, 0},
{8, 0, 0, 0, 7, 0, 0, 0, 0}
};
int[][] expectedValues =
new int[][]{
{1, 8, 5, 7, 3, 6, 2, 4, 9},
{3, 4, 6, 5, 2, 9, 1, 7, 8},
{2, 9, 7, 4, 8, 1, 6, 5, 3},
{5, 7, 8, 2, 9, 3, 4, 1, 6},
{9, 3, 2, 1, 6, 4, 7, 8, 5},
{6, 1, 4, 8, 5, 7, 9, 3, 2},
{4, 6, 3, 9, 1, 8, 5, 2, 7},
{7, 2, 9, 3, 4, 5, 8, 6, 1},
{8, 5, 1, 6, 7, 2, 3, 9, 4}
};
checkResults(inputValues, expectedValues);
}
@Test
public void TestCase3() {
int[][] inputValues =
new int[][]{
{5, 3, 8, 0, 1, 0, 0, 0, 0},
{0, 7, 9, 6, 0, 0, 0, 0, 0},
{0, 0, 4, 0, 0, 2, 0, 0, 0},
{0, 0, 7, 0, 2, 3, 4, 0, 0},
{0, 0, 5, 0, 8, 0, 0, 0, 9},
{4, 6, 0, 0, 9, 0, 0, 0, 1},
{0, 9, 0, 2, 3, 4, 1, 5, 0},
{0, 4, 1, 5, 0, 0, 2, 0, 0},
{0, 0, 0, 8, 6, 1, 0, 3, 0}
};
int[][] expectedValues =
new int[][]{
{5, 3, 8, 9, 1, 7, 6, 4, 2},
{2, 7, 9, 6, 4, 8, 5, 1, 3},
{6, 1, 4, 3, 5, 2, 7, 9, 8},
{9, 8, 7, 1, 2, 3, 4, 6, 5},
{1, 2, 5, 4, 8, 6, 3, 7, 9},
{4, 6, 3, 7, 9, 5, 8, 2, 1},
{8, 9, 6, 2, 3, 4, 1, 5, 7},
{3, 4, 1, 5, 7, 9, 2, 8, 6},
{7, 5, 2, 8, 6, 1, 9, 3, 4}
};
checkResults(inputValues, expectedValues);
}
@Test
public void TestCase4() {
int[][] inputValues =
new int[][]{
{0, 2, 0, 0, 9, 0, 1, 0, 0},
{0, 0, 7, 8, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 3, 6, 0},
{0, 0, 1, 9, 0, 4, 0, 0, 0},
{0, 0, 0, 6, 0, 5, 0, 0, 7},
{8, 0, 0, 0, 0, 0, 0, 0, 9},
{0, 0, 0, 0, 2, 0, 0, 0, 0},
{7, 0, 0, 0, 0, 0, 0, 8, 5},
{4, 9, 0, 0, 3, 0, 0, 0, 0}
};
int[][] expectedValues =
new int[][]{
{5, 2, 4, 3, 9, 6, 1, 7, 8},
{3, 6, 7, 8, 4, 1, 9, 5, 2},
{1, 8, 9, 7, 5, 2, 3, 6, 4},
{2, 5, 1, 9, 7, 4, 8, 3, 6},
{9, 4, 3, 6, 8, 5, 2, 1, 7},
{8, 7, 6, 2, 1, 3, 5, 4, 9},
{6, 1, 5, 4, 2, 8, 7, 9, 3},
{7, 3, 2, 1, 6, 9, 4, 8, 5},
{4, 9, 8, 5, 3, 7, 6, 2, 1}
};
checkResults(inputValues, expectedValues);
}
private void checkResults(int[][] inputValues, int[][] expectedValues) {
var actual = sudokuSolver.solveSudoku(inputValues);
assertTrue(Arrays.deepEquals(actual, expectedValues));
}
}