LeetCode08 有效的数独

---

前言

题目是LeetCode中初级算法部分的题目，本人使用intellij idea工具，Java语言进行编写，答案提交后都能够正确通过，附执行结果截图。

---

一、题目描述

请你判断一个 9 x 9 的数独是否有效。只需要 根据以下规则 ，验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）
示例一：

输入：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

示例二：

输入：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）或者 ‘.’

二、分析

提到不能存在重复值，我首先想到的是集合Set，我们都知道Set中是存储不了重复值的，一旦存重复的值，add方法将返回false，因此可以利用Set的这一特点进行求解，但是有一个问题，根据Set可以判断每一行、每一列、每个九宫格分别是否有重复值，难道要分别进行三次操作？这里有个技巧，就是把每个数字存储成当前行（列、九宫格）号+值组成的字符串，比如：
第i行用字符串String row = “第”+i+“行”+board[i][j];表示，
第j列用字符串String col = “第”+j+“列”+board[i][j];表示，
九宫格用字符串String box = “第”+“(”+(i/3)+“，”+(j/3)+“)个九宫格”+board[i][j];表示，
因为相邻的三行三列构成一个九宫格，因此当0<=i<3,0<=j<3的时候，i/3和j/3均为0，就表示第（0，0）个九宫格，当0<=i<3,3<=j<6的时候，i/3和j/3分别为（0，1），就表示第（0，1）个九宫格，当3<=i<6,3<=j<6的时候，i/3和j/3均为1，表示第（1，1）个九宫格，以此类推，第（i，j）个九宫格就是用（i/3，j/3）表示，于是有下面代码；

    public boolean isValidSudoku(char[][] board) {
        Set<String> set = new HashSet<>();
        for (int i = 0; i < 9; i++){
            for (int j = 0; j < 9; j++){
                if (board[i][j] != '.'){
                    String row = "第" + i + "行" + board[i][j];
                    String col = "第" + j + "列" + board[i][j];
                    String box = "第(" + i/3 + "," + j/3 + ")个九宫格" + board[i][j];
                    if(!set.add(row) || !set.add(col) || !set.add(box)){
                        return false;
                    }
                }
            }
        }
        return true;
    }

---

总结

本题的难点在于如何判断行、列、九宫格中是否有重复值。