6.28题解

36.有效的数独

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

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

上图是一个部分填充的有效的数独。

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

示例 1:

输入:
[
[“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:

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

class Solution {
    private int[] visitedRow;
    private int[] visitedCol;
    private int[][] visitedBoard;
    private int[] dataArr;
    private char[][] board;
    public boolean isValidSudoku(char[][] board) {
        dataArr = new int[9];
        this.board = board;
        for (int i = 0; i < dataArr.length; i++) {
            dataArr[i] = i + 1;
        }
        int row = board.length;
        int col = board[0].length;
        visitedRow = new int[row];
        visitedCol = new int[col];
        visitedBoard = new int[row / 3][col / 3];
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < col; j++) {
                char c = board[i][j];
                if (c != '.') {
                    int tmp = 1 << (c - '0');
                    if ((visitedRow[i] & tmp) != 0
                            || (visitedCol[j] & tmp) != 0
                            || (visitedBoard[i / 3][j / 3] & tmp) != 0) {
                        return false;
                    }
                    visitedRow[i] += tmp;
                    visitedCol[j] += tmp;
                    visitedBoard[i / 3][j / 3] += tmp;
                }
            }
        }
        return true;
    }
}

2.小区物业管理系统

见：https://github.com/2018-EPI-GROUP/2019Freshman/tree/%E5%90%B4%E5%AE%87%E8%BD%A9/%E5%B0%8F%E5%8C%BA%E7%89%A9%E4%B8%9A%E7%AE%A1%E7%90%86%E7%B3%BB%E7%BB%9F