【LeetCode】【JAVA】36. Valid Sudoku

36. Valid Sudoku

题目

判断一个 9x9 的数独是否有效。只需要根据以下规则，验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

示例

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

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

说明

• 一个有效的数独（部分已被填充）不一定是可解的。
• 只需要根据以上规则，验证已经填入的数字是否有效即可。
• 给定数独序列只包含数字 1-9 和字符 ‘.’ 。
• 给定数独永远是 9x9 形式的。

解法

定义三个boolean[9][9]，分别存储行、列、九宫格对应数字是否存在

代码

public boolean isValidSudoku(char[][] board) {
        boolean[][] rows = new boolean[9][9];		// 存储行， 一维代表行数，二维代表数字
        boolean[][] columns = new boolean[9][9];	// 存储列， 一维代表列数，二维代表数字
        boolean[][] ninegrids = new boolean[9][9];	// 存储九宫格，一维代表第几个九宫格，二维代表数字
        
        for(int i = 0; i < 9; i++) {
        	for(int j = 0; j < 9; j++) {
        		if(board[i][j] != '.') {
        			// 数字1对应的数组应该是0
        			int n = (int)(board[i][j] - '1');
        			
        			// 判断行
        			if(rows[i][n])
        				return false;
        			else
        				rows[i][n] = true;
        			
        			// 判断列
        			if(columns[j][n])
        				return false;
        			else
        				columns[j][n] = true;
        			
        			// 判断九宫格，先横着再竖着排
        			// 1 2 3
        			// 4 5 6
        			// 7 8 9
        			if(ninegrids[(i/3)*3+j/3][n])
        				return false;
        			else
        				ninegrids[(i/3)*3+j/3][n] = true;
        		}
        	}
        }
        
        return true;
    }

执行用时 : 36 ms, 在Valid Sudoku的Java提交中击败了58.49% 的用户
内存消耗 : 51.8 MB, 在Valid Sudoku的Java提交中击败了0.88% 的用户