-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patha_108_sudoku2.java
101 lines (89 loc) · 2.15 KB
/
a_108_sudoku2.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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
public class a_108_sudoku2 {
public static boolean isSafe(int sudoku[][], int row , int col , int digit){
// column's
for(int i=0; i<9; i++){
if(sudoku[i][col] == digit){
return false ;
}
}
// row's
for(int j=0; j<9; j++){
if(sudoku[row][j] == digit){
return false ;
}
}
// Grid's
int sr = (row/3) * 3 ;
int sc = (col/3) * 3 ;
// 3x3 grid
for(int i=sr ; i<sr+3 ; i++){
for(int j=sc; j<sc+3; j++){
if(sudoku[i][j] == digit){
return false ;
}
}
}
return true;
}
public static boolean solveSudoku(int[][] board, int n){
int row = -1;
int col = -1;
boolean isEmpty = true;
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
if (board[i][j] == 0){
row = i;
col = j;
isEmpty = false;
break;
}
}
if (!isEmpty) {
break;
}
}
if (isEmpty){
return true;
}
for (int digit = 1; digit <= n; digit++){
if (isSafe(board, row, col, digit)){
board[row][col] = digit;
if (solveSudoku(board, n)){
return true;
}
else{
board[row][col] = 0;
}
}
}
return false;
}
public static void print(int sudoku[][] , int N){
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
System.out.print(sudoku[i][j] + " ");
}
System.out.println();
}
}
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 }
} ;
int N = board.length;
if (solveSudoku(board, N)){
print(board, N);
}
else {
System.out.println("No solution");
}
}
}