|
1 | 1 | package com.thealgorithms.backtracking;
|
2 | 2 |
|
3 |
| -import static org.junit.jupiter.api.Assertions.assertArrayEquals; |
4 |
| - |
| 3 | +import static org.junit.jupiter.api.Assertions.assertTrue; |
5 | 4 | import org.junit.jupiter.api.Test;
|
6 | 5 |
|
7 | 6 | public class SudokuSolverTest {
|
8 | 7 |
|
9 |
| - @Test |
10 |
| - public void testSudokuSolverSolvesValidBoard() { |
11 |
| - int[][] sudoku = {{3, 0, 6, 5, 0, 8, 4, 0, 0}, {5, 2, 0, 0, 0, 0, 0, 0, 0}, {0, 8, 7, 0, 0, 0, 0, 3, 1}, {0, 0, 3, 0, 1, 0, 0, 8, 0}, {9, 0, 0, 8, 6, 3, 0, 0, 5}, {0, 5, 0, 0, 9, 0, 6, 0, 0}, {1, 3, 0, 0, 0, 0, 2, 5, 0}, {0, 0, 0, 0, 0, 0, 0, 7, 4}, {0, 0, 5, 2, 0, 6, 3, 0, 0}}; |
12 |
| - |
13 |
| - boolean solved = SudokuSolver.sudokuSolver(sudoku, 0, 0); |
14 |
| - assertTrue(solved, "SudokuSolver should solve a valid board"); |
15 |
| - } |
16 |
| - |
17 |
| - @Test |
18 |
| - public void testSudokuSolverRejectsInvalidBoard() { |
19 |
| - int[][] sudoku = new int[9][9]; |
20 |
| - sudoku[0][0] = 5; |
21 |
| - sudoku[0][1] = 5; // invalid duplicate in row |
22 |
| - |
23 |
| - boolean solved = SudokuSolver.sudokuSolver(sudoku, 0, 0); |
24 |
| - assertFalse(solved, "SudokuSolver should not solve an invalid board"); |
25 |
| - } |
| 8 | + @Test |
| 9 | + void testSudokuSolver() { |
| 10 | + int[][] sudoku = { |
| 11 | + { 5, 3, 0, 0, 7, 0, 0, 0, 0 }, |
| 12 | + { 6, 0, 0, 1, 9, 5, 0, 0, 0 }, |
| 13 | + { 0, 9, 8, 0, 0, 0, 0, 6, 0 }, |
| 14 | + { 8, 0, 0, 0, 6, 0, 0, 0, 3 }, |
| 15 | + { 4, 0, 0, 8, 0, 3, 0, 0, 1 }, |
| 16 | + { 7, 0, 0, 0, 2, 0, 0, 0, 6 }, |
| 17 | + { 0, 6, 0, 0, 0, 0, 2, 8, 0 }, |
| 18 | + { 0, 0, 0, 4, 1, 9, 0, 0, 5 }, |
| 19 | + { 0, 0, 0, 0, 8, 0, 0, 7, 9 } |
| 20 | + }; |
| 21 | + assertTrue(SudokuSolver.sudokuSolver(sudoku, 0, 0)); |
| 22 | + } |
26 | 23 | }
|
0 commit comments