LeetCode 36. 有效的数独(java)

请你判断一个 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）或者 '.'

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/valid-sudoku
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

题解:

class Solution {
    public boolean isValidSudoku(char[][] board) {
        for (int i = 0; i < board.length; i++) {
            Map<Character, Integer> row = new HashMap<>();
            for (char key:board[i]) {
                if (key != '.') {
                    row.put(key, row.getOrDefault(key, 0) + 1);
                    if (row.get(key) > 1) return false;
                }
            }
        }
        for (int i = 0; i < board[0].length; i++) {
            Map<Character, Integer> col = new HashMap<>();
            for (int j = 0; j < board.length; j++) {
                if (board[j][i] != '.') {
                    col.put(board[j][i], col.getOrDefault(board[j][i], 0) + 1);
                    if (col.get(board[j][i]) > 1) return false;
                }
            }
        }
        if (searchPart(0, 0, board) || searchPart(0, 3, board) || searchPart(0, 6, board) ||
                searchPart(3, 0, board) || searchPart(3, 3, board) || searchPart(3, 6, board) ||
                searchPart(6, 0, board) || searchPart(6, 3, board) || searchPart(6, 6, board)) {
            return false;
        }
        return true;
    }

    public static boolean searchPart(int orinRow, int orinCol, char[][] board) {
        Map<Character, Integer> map = new HashMap<>();
        for (int i = orinRow; i < orinRow + 3; i++) {
            for (int j = orinCol; j < orinCol + 3; j++) {
                if (board[i][j] != '.') {
                    map.put(board[i][j], map.getOrDefault(board[i][j], 0) + 1);
                    if (map.get(board[i][j]) > 1) return true;
                }
            }
        }
        return false;
    }
}