题目:
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.
The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.
A partially filled sudoku which is valid.
大意:
验证一个数独棋盘是否合法,数独棋盘的验证规则见链接对应的页面。
数独棋盘是部分填满的,空的位置使用点(’.’)来代替。
合法的棋盘不一定要求的可解的,只要填充的数字满足要求就可以。
思路:
依次对行、列、3×3的block进行检查。
代码:
public class Solution {
public boolean isValidSudoku(char[][] board) {
if(board == null || board.length != 9 || board[0].length != 9) {
return false;
}
for(int i = 0; i < 9; i++) {
boolean[] m = new boolean[9];
for(int j = 0; j < 9; j++) {
//判断当前元素是否为'.',不是则与字符'1'相减
//字符变量相减得到整型数字0~8
//boolean数组在初始化时默认为false
//某个数字出现过一次则将其所属的数组元素改为true
//当下一次再次出现该数字,也就是违反数独规则的时候
//通过之前的if语句将会直接返回false
if(board[i][j] != '.') {
if(m[board[i][j] - '1']) {
return false;
}
m[board[i][j] - '1'] = true;
}
}
}
for(int j = 0; j < 9; j++) {
boolean[] m = new boolean[9];
for(int i = 0; i < 9; i++) {
if(board[i][j] != '.') {
if(m[board[i][j] - '1']) {
return false;
}
m[board[i][j] - '1'] = true;
}
}
}
for(int block = 0; block < 9; block++) {
boolean[] m = new boolean[9];
for(int i = block / 3 * 3; i < block / 3 * 3 + 3; i++) {
for(int j = block % 3 * 3; j < block % 3 * 3 + 3; j++) {
if(board[i][j] != '.') {
if(m[board[i][j] - '1']) {
return false;
}
m[board[i][j] - '1'] = true;
}
}
}
}
return true;
}
}