36. 有效的数独

36. 有效的数独

难度中等469

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

1. 数字 1-9 在每一行只能出现一次。
2. 数字 1-9 在每一列只能出现一次。
3. 数字 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 存在, 因此这个数独是无效的。

说明:

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

执行用时：3 ms, 在所有 Java 提交中击败了55.32%的用户

内存消耗：38.5 MB, 在所有 Java 提交中击败了62.30%的用户

 public boolean isValidSudoku(char[][] board) {
        //行，列，每一块9格
        HashSet <Integer> row []= new HashSet[9]; 
        HashSet <Integer> line []= new HashSet[9]; 
        HashSet <Integer> block []= new HashSet[9]; 

        for(int i=0;i<9;i++){
            row[i]=new HashSet<>();
            line[i]=new HashSet<>();
            block[i]=new HashSet<>();
        }
        for(int i=0;i<board.length;i++){
            for(int j=0;j<board[i].length;j++){
                if(board[i][j]=='.'){
                    continue;
                }
                int cur_num=board[i][j]-'0';

                if(row[i].contains(cur_num)){
                    return false;
                }else{
                    row[i].add(cur_num);
                }

                if(line[j].contains(cur_num)){
                    return false;
                }else{
                    line[j].add(cur_num);
                }
                
                //计算i，j在哪个块内
                int a=i/3;
                int b=j/3;
                if(block[a*3+b].contains(cur_num)){
                    return false;
                }else{
                    block[a*3+b].add(cur_num);
                }

            }
        }
        return true;
    }

执行用时：36 ms, 在所有 Java 提交中击败了5.02%的用户
内存消耗：39.2 MB, 在所有 Java 提交中击败了5.06%的用户

    public boolean isvalid(int i,int j,char[][] board){
        int cur_num=board[i][j]-'0';
        int each_num=0;
        //验证行
        for(int k=0;k<board.length;k++){
            if(board[i][k]=='.') continue;
            each_num=board[i][k]-'0';
            if(each_num==cur_num) return false;
        }
        //验证列
        for(int k=0;k<board.length;k++){
            if(board[k][j]=='.') continue;
            each_num=board[k][j]-'0';
            if(each_num==cur_num) return false;
        }
        //验证周围9格
        int a=i/3;
        int b=j/3;
        for(int x=a*3;x<(a+1)*3;x++){
            for(int y=b*3;y<(b+1)*3;y++){
                if(board[x][y]=='.') continue;
                each_num=board[x][y]-'0';
                if(each_num==cur_num) return false;
            }
        }
        return true;
    }
    public boolean isValidSudoku(char[][] board) {
        //
        for(int i=0;i<board.length;i++){
            for(int j=0;j<board[i].length;j++){
                if(board[i][j]=='.'){
                    continue;
                }
                if(isvalid(i,j,board)==false) return false;
            }
        }
        return true;
    }
}