forked from hongtaocai/code_interview
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsudokusolver.java
More file actions
executable file
·70 lines (65 loc) · 1.77 KB
/
sudokusolver.java
File metadata and controls
executable file
·70 lines (65 loc) · 1.77 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
public class Solution {
char [][] board;
boolean flag;
private boolean check(int x, int y, int number){
char target = (char) (number+'0');
for(int i=0;i<9;i++){
if(board[x][i]==target){
return false;
}
if(board[i][y]==target){
return false;
}
}
for(int i=(x/3)*3;i<=(x/3)*3+2;i++){
for(int j=(y/3)*3;j<=(y/3)*3+2;j++){
if(board[i][j]==target){
return false;
}
}
}
return true;
}
public void solveSudoku(int x, int y, int number){
if(number==0){
flag = true;
return;
}
if(!flag){
int i=0;
int j=0;
loop1: for(i=x;i<9;i++){
for(j=0;j<9;j++){
if(i==x && j<y ) continue;
if(board[i][j]=='.'){
break loop1;
}
}
}
for(int k=1;k<=9;k++){
if(check(i,j,k) && !flag){
board[i][j]=(char)('0'+k);
solveSudoku(i,j+1,number-1);
if(!flag){
board[i][j]='.';
}
}
}
}
}
public void solveSudoku(char[][] board) {
// Start typing your Java solution below
// DO NOT write main() function
this.board = board;
flag = false;
int sum = 0;
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
if(board[i][j]=='.'){
sum++;
}
}
}
solveSudoku(0,0,sum);
}
}