LeetCode 36.有效的数独【Java】

1.题目

请你判断一个 9x9 的数独是否有效。只需要 根据以下规则 ，验证已经填入的数字是否有效即可。

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

数独部分空格内已填入了数字，空白格用 '.' 表示。

输入：board = 
[["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

注意：

• 一个有效的数独（部分已被填充）不一定是可解的。
• 只需要根据以上规则，验证已经填入的数字是否有效即可。
• board.length == 9
• board[i].length == 9
• board[i][j] 是一位数字或者 ‘.’

2.思路和代码

仔细观察题目可知，验证已经填入的数字是否有效即可。 所以我们可以将问题转换为：

1. 每一行出现的数字是否只出现一次。
2. 每一列出现的数字是否只出现一次。
3. 每一3×3宫格出现的数字是否只出现一次
   我们可以分别设三个二维数组来各自同时进行验证

class Solution {
    public boolean isValidSudoku(char[][] board) {
        int[][] row = new int[9][10];//验证行，此数组的行数为行数，列数用来验证数值是否只出现一次
		int[][] col = new int[9][10];//验证列，同上
		int[][] box = new int[9][10];//验证宫格，行数为宫格号，列数同上
        for(int i = 0; i < 9; i++){
            for(int j = 0; j < 9; j++){
                if(board[i][j] == '.'){
                    continue;
                }
                int num = board[i][j] - '0';
                if(row[i][num] == 1 ||col[j][num] == 1 ||box[i/3 + (j/3)*3][num] == 1){
                    return false;
                }
                row[i][num]++;
                col[j][num]++;
                box[i/3 + (j/3)*3][num]++;
            }
        }
        return true;
    }
}