LeetCode有效的数独

题目要求：

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

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）
 

注意：

一个有效的数独（部分已被填充）不一定是可解的。
只需要根据以上规则，验证已经填入的数字是否有效即可。
空白格用 '.' 表示。

示例 1：

输入：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

解题思路：

创建三个数组，分别记录数字所在行，列，小方格内出现的次数，若次数大于一，则无效

代码展示：

Java：

class Solution {
    public boolean isValidSudoku(char[][] board) {
        int[][] row = new int[9][9];
        int[][] col = new int[9][9];
        int[][][] m = new int [3][3][9];
        for(int i = 0;i<9;i++){
            for(int j = 0;j<9;j++){
                char c = board[i][j];
                if(c != '.'){
                    int index = c-'0'-1;
                    row[i][index]++;
                    col[j][index]++;
                    m[i/3][j/3][index]++;
                    if(row[i][index]>1||col[j][index]>1||m[i/3][j/3][index]>1){
                        return false;
                    }
                }
            }
        }
        return true;
    }
}