FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
java-algorithm-2010/PuzzleCoding/src/ValidSudoku.java at master · xiaoningning/java-algorithm-2010 · GitHub
xiaoningning
java-algorithm-2010
Repository navigation
Code
Issues
Pull requests
1
(1)
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
java-algorithm-2010
/
PuzzleCoding
/
src
/
ValidSudoku.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
78 lines (70 loc) · 2.57 KB
Breadcrumbs
java-algorithm-2010
/
PuzzleCoding
/
src
/
ValidSudoku.java
Copy path
File metadata and controls
78 lines (70 loc) · 2.57 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/**
* Determine if a Sudoku is valid,
* Each row must have the numbers 1-9 occurring just once.
* Each column must have the numbers 1-9 occurring just once.
* the numbers 1-9 must occur just once in each of the 9 sub-boxes of the grid.
* <p/>
* The Sudoku board could be partially filled, where empty cells are filled with the character '.'.
*/
public
class
ValidSudoku
{
public
static
void
main
(
String
[]
args
) {
char
[][]
grid
=
new
char
[
9
][
9
];
grid
[
0
] =
"53..7...."
.
toCharArray
();
grid
[
1
] =
"6..195..."
.
toCharArray
();
grid
[
2
] =
".98....6."
.
toCharArray
();
grid
[
3
] =
"8...6...3"
.
toCharArray
();
grid
[
4
] =
"4..8.3..1"
.
toCharArray
();
grid
[
5
] =
"7...2...6"
.
toCharArray
();
grid
[
6
] =
".6....28."
.
toCharArray
();
grid
[
7
] =
"...419..5"
.
toCharArray
();
grid
[
8
] =
"....8..79"
.
toCharArray
();
boolean
isValid
=
isValidSudoku
(
grid
);
System
.
out
.
print
(
isValid
);
}
public
static
boolean
isValidSudoku
(
char
[][]
board
) {
boolean
[]
checked
;
//validate row
for
(
int
i
=
0
;
i
<
board
.
length
;
i
++) {
checked
=
new
boolean
[
board
.
length
];
for
(
int
j
=
0
;
j
<
board
[
0
].
length
;
j
++) {
if
(
board
[
i
][
j
] !=
'.'
) {
int
index
=
board
[
i
][
j
] -
'0'
;
if
(
checked
[
index
-
1
])
return
false
;
else
checked
[
index
-
1
] =
true
;
}
}
}
//validate column
for
(
int
j
=
0
;
j
<
board
[
0
].
length
;
j
++) {
checked
=
new
boolean
[
board
.
length
];
for
(
int
i
=
0
;
i
<
board
.
length
;
i
++) {
if
(
board
[
i
][
j
] !=
'.'
) {
int
index
=
board
[
i
][
j
] -
'0'
;
if
(
checked
[
index
-
1
])
return
false
;
else
checked
[
index
-
1
] =
true
;
}
}
}
//validate 3x3 sub-box
for
(
int
i
=
0
;
i
<
board
.
length
;
i
++) {
checked
=
new
boolean
[
board
.
length
];
for
(
int
j
=
0
;
j
<
board
[
0
].
length
;
j
++) {
//convert to box sub-index
int
r
=
i
/
3
*
3
+
j
/
3
;
int
c
=
i
%
3
*
3
+
j
%
3
;
if
(
board
[
r
][
c
] !=
'.'
) {
int
index
=
board
[
r
][
c
] -
'0'
;
if
(
checked
[
index
-
1
])
return
false
;
else
checked
[
index
-
1
] =
true
;
}
}
}
return
true
;
}
}
Back
|
FazBrowse Home
|
New Git URL