forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSudokuSolver.java
More file actions
84 lines (73 loc) · 2.78 KB
/
SudokuSolver.java
File metadata and controls
84 lines (73 loc) · 2.78 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
package main.java.com.thealgorithms.backtracking;
public class SudokuSolver {
public static boolean sudokuSolver(int[][] sudoku, int row, int col) {
if (row == 9) {
return true; // base case: reached the end
}
int nextRow = row;
int nextCol = col + 1;
if (nextCol == 9) {
nextRow = row + 1;
nextCol = 0;
}
if (sudoku[row][col] != 0) {
return sudokuSolver(sudoku, nextRow, nextCol);
}
for (int num = 1; num <= 9; num++) {
if (isSafe(sudoku, row, col, num)) {
sudoku[row][col] = num;
if (sudokuSolver(sudoku, nextRow, nextCol)) {
return true;
}
sudoku[row][col] = 0; // backtrack
}
}
return false;
}
private static boolean isSafe(int[][] sudoku, int row, int col, int num) {
// Check row and column
for (int i = 0; i < 9; i++) {
if (sudoku[row][i] == num || sudoku[i][col] == num) {
return false;
}
}
// Check 3x3 subgrid
int startRow = row - row % 3;
int startCol = col - col % 3;
for (int i = startRow; i < startRow + 3; i++) {
for (int j = startCol; j < startCol + 3; j++) {
if (sudoku[i][j] == num) {
return false;
}
}
}
return true;
}
private static void printSudoku(int[][] sudoku) {
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
System.out.print(sudoku[i][j] + " ");
}
System.out.println();
}
}
public static void main(String[] args) {
int[][] sudoku = {
{ 5, 3, 0, 0, 7, 0, 0, 0, 0 },
{ 6, 0, 0, 1, 9, 5, 0, 0, 0 },
{ 0, 9, 8, 0, 0, 0, 0, 6, 0 },
{ 8, 0, 0, 0, 6, 0, 0, 0, 3 },
{ 4, 0, 0, 8, 0, 3, 0, 0, 1 },
{ 7, 0, 0, 0, 2, 0, 0, 0, 6 },
{ 0, 6, 0, 0, 0, 0, 2, 8, 0 },
{ 0, 0, 0, 4, 1, 9, 0, 0, 5 },
{ 0, 0, 0, 0, 8, 0, 0, 7, 9 }
};
if (sudokuSolver(sudoku, 0, 0)) {
System.out.println("Sudoku Solved:");
printSudoku(sudoku);
} else {
System.out.println("No solution exists.");
}
}
}