-
Notifications
You must be signed in to change notification settings - Fork 0
/
Sudoku.java
92 lines (84 loc) · 2.81 KB
/
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
package javaCodes;
public class Sudoku {
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}
};
if(solve(board)) {
display(board);
} else {
System.out.println("Cannot solve! Please try again!");
}
}
static boolean solve(int[][] board) {
int row = -1;
int col = -1;
boolean left = true;
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board.length; j++) {
if(board[i][j]==0) {
row = i;
col = j;
left= false;
break;
}
}
if(left==false) {
break;
}
}
if(left == true) {
return true;
}
for (int n = 0; n <= 9 ; n++) {
if(valid(board,row,col,n)) {
board[row][col] = n;
if(solve(board)) {
return true;
} else {
board[row][col] = 0;
}
}
}
return false;
}
private static void display(int[][] board) {
for(int[] row : board) {
for(int num : row) {
System.out.print(num + " ");
}
System.out.println();
}
}
static boolean valid(int board[][], int row, int col, int num) {
for (int i = 0; i < board.length ; i++) {
if(board[row][col]== num) {
return false;
}
}
for (int[] number : board) {
if(number[col] == num) {
return false;
}
}
int sqrt = (int)(Math.sqrt(board.length));
int rstart = row - row%sqrt;
int cstart = col - col%sqrt;
for(int r=rstart ; r< rstart + sqrt; r++) {
for (int c = cstart; c < cstart+sqrt ; c++) {
if(board[r][c]==num) {
return false;
}
}
}
return true;
}
}