有效的数独

判断一个 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 存在, 因此这个数独是无效的。
说明:

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

import java.util.HashSet;
class Solution {
    public static boolean isValidSudoku(char[][] board) {
        for(int i=0;i<board.length;i++){
            StringBuilder sb=new StringBuilder();
            StringBuilder sb1=new StringBuilder();
            for(int j=0;j<board[i].length;j++){
                sb.append(board[i][j]);
                sb1.append(board[j][i]);
            }
            char[] arr=sb.toString().toCharArray();
            char[] arr1=sb1.toString().toCharArray();
            sb.delete(0,sb.length());
            sb1.delete(0,sb1.length());
            for(int k=0;k<arr.length;k++){
                if(arr[k]!='.') sb.append(arr[k]);
                if(arr1[k]!='.') sb1.append(arr1[k]);
            }
            char[] arrr=sb.toString().toCharArray();
            char[] arr1r=sb1.toString().toCharArray();
            HashSet hs=new HashSet();
            HashSet hs1=new HashSet();
            for(int l=0;l<arrr.length;l++){
                hs.add(arrr[l]);
            }
            for(int l=0;l<arr1r.length;l++){
                hs1.add(arr1r[l]);
            }
            if(hs.size()!=arrr.length||hs1.size()!=arr1r.length) return false;
        }
        for(int j=0;j<board.length;j+=3){
            for(int k=0;k<board.length;k+=3){
                StringBuilder sb2=new StringBuilder();
                for(int z=0;z<3;z++){
                    for(int l=0;l<3;l++){
                        sb2.append(board[j+z][k+l]);
                    }
                }
                char[] arr2=sb2.toString().toCharArray();
                sb2.delete(0,sb2.length());
                for(int a=0;a<arr2.length;a++){
                    if(arr2[a]=='.') continue;
                    sb2.append(arr2[a]);
                }
                char [] arr2r=sb2.toString().toCharArray();
                HashSet hs2=new HashSet();
                for(int l=0;l<arr2r.length;l++){
                    hs2.add(arr2r[l]);
                }
                if(hs2.size()!=arr2r.length) return false;
            }
        }
        return true;
    }

    public static void main(String[] args) {
    	//在IDE上debug测试一下
        System.out.println(isValidSudoku(new char[][]{
                {'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'}
        }));
    }
}