题目链接
https://leetcode-cn.com/problems/valid-sudoku/
描述
判断一个 9x9 的数独是否有效。只需要根据以下规则,验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。
上图是一个部分填充的有效的数独。
数独部分空格内已填入了数字,空白格用 '.' 表示。
说明:
一个有效的数独(部分已被填充)不一定是可解的。
只需要根据以上规则,验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9 和字符 '.' 。
给定数独永远是 9x9 形式的。
示例
示例 1:
输入:
[
["5","3",".",".","7",".",".",".","."],
["6",".",".","1","9","5",".",".","."],
[".","9","8",".",".",".",".","6","."],
["8",".",".",".","6",".",".",".","3"],
["4",".",".","8",".","3",".",".","1"],
["7",".",".",".","2",".",".",".","6"],
[".","6",".",".",".",".","2","8","."],
[".",".",".","4","1","9",".",".","5"],
[".",".",".",".","8",".",".","7","9"]
]
输出: true
示例 2:
输入:
[
["8","3",".",".","7",".",".",".","."],
["6",".",".","1","9","5",".",".","."],
[".","9","8",".",".",".",".","6","."],
["8",".",".",".","6",".",".",".","3"],
["4",".",".","8",".","3",".",".","1"],
["7",".",".",".","2",".",".",".","6"],
[".","6",".",".",".",".","2","8","."],
[".",".",".","4","1","9",".",".","5"],
[".",".",".",".","8",".",".","7","9"]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外,空格内其他数字均与 示例1 相同。
但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。
初始代码模板
class Solution {
public boolean isValidSudoku(char[][] board) {
}
}
代码
题目并不难,只是有些繁琐而已,推荐题解:
https://leetcode-cn.com/problems/valid-sudoku/solution/you-xiao-de-shu-du-by-leetcode/
另外还有更巧妙的解法,使用位运算:
https://leetcode-cn.com/problems/valid-sudoku/solution/java-wei-yun-suan-xiang-jie-miao-dong-zuo-biao-bia/
用数组基本就可以解决了,map、set什么的也都可以,不过数据量小,数组已经足够。
class Solution {
public boolean isValidSudoku(char[][] board) {
int[][] rowArr = new int[9][9];
int[][] colArr = new int[9][9];
int[][] boxArr = new int[9][9];
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
if (board[i][j] == '.') {
continue;
}
//对应的行数组
if (rowArr[i][board[i][j] - '1'] == 1) {
return false;
} else {
rowArr[i][board[i][j] - '1'] = 1;
}
//对应的列数组
if (colArr[j][board[i][j] - '1'] == 1) {
return false;
} else {
colArr[j][board[i][j] - '1'] = 1;
}
//对应的盒子数组
if (boxArr[i / 3 * 3 + j / 3][board[i][j] - '1'] == 1) {
return false;
} else {
boxArr[i / 3 * 3 + j / 3][board[i][j] - '1'] = 1;
}
}
}
return true;
}
}