Leetcode 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 形式的。

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

思路： 每个数组内的已填数字不重复；九个数组对应索引位置的已填数字不重复；每个九宫格小块内的数字不重复

/**
 * @param {character[][]} board
 * @return {boolean}
 */
var isValidSudoku = function(board) {
    // 思路：每个数组内的已填数字不重复；九个数组对应索引位置的已填数字不重复；每个九宫格小块内的数字不重复
     for(let i = 0; i < 9; i++) {
            let help1 = [], help2 = [];
            for(let j = 0; j < 9; j++) {
                if(board[i][j] !== ".") {
                    help1.push(board[i][j]);
                }
                if(board[j][i] !== ".") {
                    help2.push(board[j][i]);
                }
            }
            let temp1 = [...(new Set(help1))];
            let temp2 = [...(new Set(help2))];
            if(temp1.length !== help1.length || temp2.length !== help2.length) {
                return false;
            }
        }

        for(let x = 0; x < 9; x += 3) {
            for(let y = 0; y < 9; y += 3) {
                let help3 = [];
                for(let a = x; a < 3+x; a++) {
                    for(let b = y; b < 3+y; b++) {
                        if(board[a][b] !== ".") {
                            help3.push(board[a][b])
                        }
                    }
                }
                let temp3 = [...(new Set(help3))];
                if(temp3.length !== help3.length) {
                    return false;
                }

            }
        }
        return true;
    };