数组：有效的数独

---

一、题目

请你判断一个 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

示例 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）或者 '.'

二、解题思路+代码实现

位运算

代码如下（示例）：
使用一个 int 来记录 某行/某列/某个小方块 的数值填入情况：使用从低位开始的 [1,9] 位来记录该数值是否已被填入。

class Solution {
        public boolean isValidSudoku(char[][] board) {
        int[] line = new int[9];
        int[] column = new int[9];
        int[] cell = new int[9];
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                // 如果不是数字，则跳过
                if (board[i][j] == '.')
                    continue;
                // 表示数字的第几位
                System.out.println("111:"+" "+ (board[i][j] - '0'));
                int shift = 1 << (board[i][j] - '0' - 1);
                // k表示第几个3*3的小宫格
                int k = (i / 3) * 3 + j / 3;
                // 如果对应的位置只要有一个不等于0，说明有重复的，
                // 直接返回false
                if ((line[i] & shift) != 0 ||
                        (column[j] & shift) != 0 ||
                        (cell[k] & shift) != 0)
                    return false;
                // 把对应的位置标记为1
                line[i] |= shift;
                column[j] |= shift;
                cell[k] |= shift;
            }
        }
        return true;
    }
}

作者：LeetCode
链接：https://leetcode.cn/leetbook/read/top-interview-questions-easy/x2f9gg/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。