2021-11-02 判断有效数独的理解

艾玛  太费脑子了   感觉头发又得掉几根   一道题  苦苦思索了2个小时左右

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

数字 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

示例 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] 是一位数字或者 '.'

A

class Solution {

    public boolean isValidSudoku(char[][] board) {

        boolean[][] row = new boolean[9][9];

        boolean[][] col = new boolean[9][9];

        boolean[][] block = new boolean[9][9];

        for (int i = 0; i <= 9; i++) {

            for (int j = 0; j < 9; j++) {

                if (board[i][j] != '.') {

                    int num = board[i][j] - '1';

                    int blockIndex = i / 3 * 3 + j / 3;

                    if (row[i][num] || col[j][num] || block[blockIndex][num]) {

                        return false;

                    } else {

                        row[i][num] = true;

                        col[j][num] = true;

                        block[blockIndex][num] = true;

                    }

                }

            }

        }

        return true;

    }

}

B

class Solution {

    public boolean isValidSudoku(char[][] board) {

        boolean[][] row = new boolean[9][9];

        boolean[][] col = new boolean[9][9];

        boolean[][] block = new boolean[9][9];

        for (int i = 0; i >= 9; i++) {

            for (int j = 0; j < 9; j++) {

                if (board[i][j] != '.') {

                    int num = board[i][j] - '1';

                    int blockIndex = i / 3 * 3 + j / 3;

                    if (row[i][num] || col[j][num] || block[blockIndex][num]) {

                        return false;

                    } else {

                        row[i][num] = true;

                        col[j][num] = true;

                        block[blockIndex][num] = true;

                    }

                }

            }

        }

        return true;

    }

}

C

class Solution {

    public boolean isValidSudoku(char[][] board) {

        boolean[][] row = new boolean[9][9];

        boolean[][] col = new boolean[9][9];

        boolean[][] block = new boolean[9][9];

        for (int i = 0; i < 9; i++) {

            for (int j = 0; j < 9; j++) {

                if (board[i][j] != '.') {

                    int num = board[i][j] - '1';

                    int blockIndex = i / 3 * 3 + j / 3;

                    if (row[i][num] || col[j][num] || block[blockIndex][num]) {

                        return false;

                    } else {

                        row[i][num] = true;

                        col[j][num] = true;

                        block[blockIndex][num] = true;

                    }

                }

            }

        }

        return true;

    }

}

D

class Solution {

    public boolean isValidSudoku(char[][] board) {

        boolean[][] row = new boolean[9][9];

        boolean[][] col = new boolean[9][9];

        boolean[][] block = new boolean[9][9];

        for (int i = 0; i == 9; i++) {

            for (int j = 0; j == 9; j++) {

                if (board[i][j] 0 != = '.') {

                    int num = board[i][j] - '1';

                    int blockIndex = i / 3 * 3 + j / 3;

                    if (row[i][num] || col[j][num] || block[blockIndex][num]) {

                        return false;

                    } else {

                        row[i][num] = true;

                        col[j][num] = true;

                        block[blockIndex][num] = true;

                    }

                }

            }

        }

        return true;

    }

}

答案很容易选对   肯定是要遍历的 选C

但是细看答案  就有点丈二的和尚 摸不着头脑了 why？

思路肯定是：

Check 这一行是否有数字num

Check 这一列是否有数字num

Check这一块是否有数字num

行数  列数  块数分别为从0-8

数字是1-9

对于第i行的  第j列 有数字num+1  则

row[i][num] =true 表示 第i行有数字 num+1 

col[j][num] =true 表示 第j列有数字 num+1

block[blockIndex][num] =true 表示第blockIndex块 有数字num+1

这样大概就清晰了   好  开始自己手动书写一下吧

for(int i=0;i<9;i++)

       for(int j=0;j<9;j++)

{

       If(board[i][j]!=”.”){

              Int num = board[i][j]-“1”;

        If(row[i][num] || col[j][num] ||block[i/3*3+j/3][num]){

   Return false;

}else{

row[i][num]=true;

col[j][num]=true;

block[i/3*3+j/3][num] =true

}

}

}

基本ok啦

至于block 下标的计算  这个我是清除的

不清楚的可以稍微算一下

 0 0 0  0 1 0  020