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

说明:

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

思路+代码+注释：

public static boolean isValidSudoku(char[][] board) {
          /*
          思路：先看每一行是否有重复的数字，每一行就是二维数组中的元素
          再看每一列是否有重复的数字，所有二维数组元素的同一个位置字符

          针对3*3的格子(横着数)
          第一个格子是外层0 1 2、内层0 1 2
          第二个格子是外层0 1 2、内层3 4 5
          第三个格子是外层0 1 2、内层6 7 8
          第二层三个格子外层都是3 4 5，内层分别是0 1 2，3 4 5，6 7 8
           */
          //定义一个大小为9的数组，数组中每个元素代表对应数字出现的次数
        int[] numCount=new int[9];
        //验证每一行的
        for (int i = 0; i < board.length; i++) {
            for (char c:board[i]
                 ) {
               switch (c)
               {
                   case '1':numCount[0]++;
                        break;
                   case '2':numCount[1]++;
                        break;
                   case '3':numCount[2]++;
                       break;
                   case '4':numCount[3]++;
                       break;
                   case '5':numCount[4]++;
                       break;
                   case '6':numCount[5]++;
                       break;
                   case '7':numCount[6]++;
                       break;
                   case '8':numCount[7]++;
                       break;
                   case '9':numCount[8]++;
                       break;
               }
            }
            for (int j = 0; j < numCount.length; j++) {
                //如果大于1证明出现多次，直接返回false
                if (numCount[j]>1)
                {
                    return false;
                }
                //如果不大于1，那么归零，为下次做准备
                numCount[j]=0;
            }
        }
        //验证每一列的,共9列
        for (int i = 0; i < numCount.length; i++) {
            //每一列
            for (int j = 0; j < board.length; j++) {
                char c=board[j][i];
                switch (c)
                {
                    case '1':numCount[0]++;
                        break;
                    case '2':numCount[1]++;
                        break;
                    case '3':numCount[2]++;
                        break;
                    case '4':numCount[3]++;
                        break;
                    case '5':numCount[4]++;
                        break;
                    case '6':numCount[5]++;
                        break;
                    case '7':numCount[6]++;
                        break;
                    case '8':numCount[7]++;
                        break;
                    case '9':numCount[8]++;
                        break;
                }
            }
            for (int j = 0; j < numCount.length; j++) {
                //如果大于1证明出现多次，直接返回false
                if (numCount[j]>1)
                {
                    return false;
                }
                //如果不大于1，那么归零，为下次做准备
                numCount[j]=0;
            }
        }
        //验证三层格子
        //验证第一层3个格子
        int j=0;
        for (int k = 0; k < 3; k++) {
            int endJ=j+3;
            //验证每个格子
            for (int i = 0; i < 3; i++) {
                j=endJ-3;
                for (; j < endJ; j++) {
                    char c=board[i][j];
                    switch (c)
                    {
                        case '1':numCount[0]++;
                            break;
                        case '2':numCount[1]++;
                            break;
                        case '3':numCount[2]++;
                            break;
                        case '4':numCount[3]++;
                            break;
                        case '5':numCount[4]++;
                            break;
                        case '6':numCount[5]++;
                            break;
                        case '7':numCount[6]++;
                            break;
                        case '8':numCount[7]++;
                            break;
                        case '9':numCount[8]++;
                            break;
                    }
                }
            }
            for (int m = 0; m < numCount.length; m++) {
                //如果大于1证明出现多次，直接返回false
                if (numCount[m]>1)
                {
                    return false;
                }
                //如果不大于1，那么归零，为下次做准备
                numCount[m]=0;
            }
        }

        //验证第二层3个格子
        j=0;
        for (int k = 0; k < 3; k++) {
            int endJ=j+3;
            //验证每个格子
            for (int i = 3; i < 6; i++) {
                j=endJ-3;
                for (; j < endJ; j++) {
                    char c=board[i][j];
                    switch (c)
                    {
                        case '1':numCount[0]++;
                            break;
                        case '2':numCount[1]++;
                            break;
                        case '3':numCount[2]++;
                            break;
                        case '4':numCount[3]++;
                            break;
                        case '5':numCount[4]++;
                            break;
                        case '6':numCount[5]++;
                            break;
                        case '7':numCount[6]++;
                            break;
                        case '8':numCount[7]++;
                            break;
                        case '9':numCount[8]++;
                            break;
                    }
                }
            }
            for (int m = 0; m < numCount.length; m++) {
                //如果大于1证明出现多次，直接返回false
                if (numCount[m]>1)
                {
                    return false;
                }
                //如果不大于1，那么归零，为下次做准备
                numCount[m]=0;
            }
        }


        //验证第三层3个格子
        j=0;
        for (int k = 0; k < 3; k++) {
            int endJ=j+3;
            //验证每个格子
            for (int i = 6; i < 9; i++) {
                j=endJ-3;
                for (; j < endJ; j++) {
                    char c=board[i][j];
                    switch (c)
                    {
                        case '1':numCount[0]++;
                            break;
                        case '2':numCount[1]++;
                            break;
                        case '3':numCount[2]++;
                            break;
                        case '4':numCount[3]++;
                            break;
                        case '5':numCount[4]++;
                            break;
                        case '6':numCount[5]++;
                            break;
                        case '7':numCount[6]++;
                            break;
                        case '8':numCount[7]++;
                            break;
                        case '9':numCount[8]++;
                            break;
                    }
                }
            }
            for (int m = 0; m < numCount.length; m++) {
                //如果大于1证明出现多次，直接返回false
                if (numCount[m]>1)
                {
                    return false;
                }
                //如果不大于1，那么归零，为下次做准备
                numCount[m]=0;
            }
        }
        return true;
    }