/
Solve_the_Sudoku.java
101 lines (85 loc) · 2.04 KB
/
Solve_the_Sudoku.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
// { Driver Code Starts
//Initial Template for Java
import java.util.*;
import java.io.*;
import java.lang.*;
class Driver_class {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while (t-- > 0) {
int grid[][] = new int[9][9];
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++)
grid[i][j] = sc.nextInt();
}
Solution ob = new Solution();
if (ob.SolveSudoku(grid) == true)
ob.printGrid(grid);
else
System.out.print("NO solution exists");
System.out.println();
}
}
}
// } Driver Code Ends
// User function Template for Java
class Solution {
static boolean SolveSudoku(int grid[][]) {
int row = -1, col = -1;
boolean isEmpty = false;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
if (grid[i][j] == 0) {
row = i;
col = j;
isEmpty = true;
break;
}
}
if (isEmpty)
break;
}
if (!isEmpty)
return true;
for (int i = 1; i <= 9; i++) {
if (isSafe(grid, row, col, i)) {
grid[row][col] = i;
if (SolveSudoku(grid)) {
return true;
} else {
grid[row][col] = 0;
}
}
}
return false;
}
static boolean isSafe(int[][] grid, int row, int col, int num) {
for (int i = 0; i < 9; i++) {
if (grid[row][i] == num)
return false;
}
for (int i = 0; i < 9; i++) {
if (grid[i][col] == num)
return false;
}
int sqrt = (int) Math.sqrt(9);
int rowStart = row - row % sqrt;
int colStart = col - col % sqrt;
for (int i = rowStart; i < rowStart + sqrt; i++) {
for (int j = colStart; j < colStart + sqrt; j++) {
if (grid[i][j] == num) {
return false;
}
}
}
return true;
}
static void printGrid(int grid[][]) {
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
System.out.print(grid[i][j] + " ");
}
}
}
}