-
Notifications
You must be signed in to change notification settings - Fork 33
/
Copy pathSudokuSolver.java
81 lines (74 loc) · 2.31 KB
/
SudokuSolver.java
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
// https://leetcode.com/problems/sudoku-solver/
// Agniva
public class SudokuSolver {
public static void main(String[] args) {
int[][] board = new int[][]{
{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}
};
solve(board, 0,0);
}
public static void solve(int[][] board, int row, int col){
if(row == board.length){
display(board);
return;
}
int nRow = 0;
int nCol = 0;
if(col == board[0].length-1){
nRow = row + 1;
nCol = 0;
}else{
nRow = row;
nCol = col + 1;
}
if(board[row][col] != 0){
solve(board, nRow, nCol);
}else {
for (int po = 1; po <= 9; po++) {
if(isValid(board, row, col, po)){
board[row][col] = po;
solve(board, nRow, nCol);
board[row][col] = 0;
}
}
}
}
public static boolean isValid(int[][] board, int row, int col, int num){
for (int i = 0; i < board[0].length; i++) {
if(board[row][i] == num){
return false;
}
}
for (int i = 0; i < board.length; i++) {
if(board[i][col] == num){
return false;
}
}
int rowStart = row/3 * 3;
int colStart = col/3 * 3;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if(board[rowStart+i][colStart+j] == num){
return false;
}
}
}
return true;
}
public static void display(int[][] board){
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board[0].length; j++) {
System.out.print(board[i][j] + " ");
}
System.out.println();
}
}
}