leetcode 36：有效的数独

leetcode 36：有效的数独

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

1. 数字 1-9 在每一行只能出现一次。
2. 数字 1-9 在每一列只能出现一次。
3. 数字 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

示例 2：

输入：board = 
[["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 存在, 因此这个数独是无效的。

提示：

• board.length == 9
• board[i].length == 9
• board[i][j] 是一位数字（1-9）或者 '.'

Related Topics

数组

哈希表

矩阵

思路

把每行、每列、和每个3*3都判断。

class Solution {
    public boolean isValidSudoku(char[][] board) {
        int m = board.length;
        boolean[] flag;
        //判断每一行
        for(int i = 0 ;i < m ; i++){
            flag = new boolean[m];
            for(int j = 0 ; j < m;j++){
                char c = board[i][j];
                if(c>='1'&&c<='9'){
                    int index = c-'1';
                    if(flag[index]){
                        return false;
                    }else{
                        flag[index] = true;
                    }
                }
            }
        }
        //判断每一列
        for(int j = 0;j < m;j++){
            flag = new boolean[m];
            for(int i = 0 ; i < m;i++){
                char c = board[i][j];
                if(c>='1'&&c<='9'){
                    int index = c-'1';
                    if(flag[index]){
                        return false;
                    }else{
                        flag[index] = true;
                    }
                }
            }
        }
        //判断3*3
        for(int i = 0;i < m;i++){
            for(int j = 0 ; j < m;j++){
                if(!isfun(board,i,j)){
                    return false;
                }
                j += 2;
            }
            i +=2;
        }
        return true;
    }
    public boolean isfun(char[][] board,int i,int j){
        boolean[] flag = new boolean[board.length];
        for(int x = i;x<i+3;x++){
            for(int y = j;y<j+3;y++){
                char c = board[x][y];
                if(c>='1'&&c<='9'){
                    int index = c-'1';
                    if(flag[index]){
                        return false;
                    }else{
                        flag[index] = true;
                    }
                }
            }
        }
        return true;
    }
}