leetcode36 有效的数独

题目：

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

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/valid-sudoku

 

思路：

好水的题。我们的目的是一次遍历，就能够判断出是否符合题意。

x轴和y轴好说（分别拿9个set就能判定每一行和每一列是否符合题意），只是这个3x3的格子不太好判定。

如上图所示（我从leetcode官方题解那抄过来然后加了个坐标系的，顺便吐槽一句，总感觉国内的官方题解不怎么样）

那么这一题唯一的考点可能就在1将二维坐标合并为一个数字：  (i/3)*3 + j/3

(为了截图我去评论区逛了一圈，怎么都在用hashmap(value为count)的方式？用数组还能理解。没多想，反正水题)

代码如下：

class Solution {
    public boolean isValidSudoku(char[][] board) {
        // 存每一行的set
        Set[] setX = new Set[9];
        // 存每一列的set
        Set[] setY = new Set[9];
        // 拆分为9个单元格
        Set[] setBox = new Set[9];
        for(int i=0;i<9;i++) {
            setX[i] = new HashSet<Integer>();
            setY[i] = new HashSet<Integer>();
            setBox[i] = new HashSet<Integer>();
        }
        for(int i=0;i<9;i++) {
            for(int j=0;j<9;j++) {
                //当前字符
                char curChar = board[i][j];
                if(curChar == '.') {
                    continue;
                }
                if(!setX[i].add(curChar)) {
                    return false;
                }
                if(!setY[j].add(curChar)) {
                    return false;
                }
                // 拆分为九个单元格，每个单元格的索引
                int curBoxIndex = (i/3)*3 + j/3;
                if(!setBox[curBoxIndex].add(curChar)) {
                    return false;
                }
            }     
        }

        return true;
    }
}