【LeetCode】36. 有效的数独（JAVA）

原题地址：https://leetcode-cn.com/problems/valid-sudoku/submissions/

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

1. 数字 1-9 在每一行只能出现一次。
2. 数字 1-9 在每一列只能出现一次。
3. 数字 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 形式的。

解题方案：
看了官方解法用hashmap存储的，每行、列、子数独为一个hashmap，将这一行、列、子数独所有出现的数存入，如果出现超过一次就返回false
代码：

class Solution {
    public boolean isValidSudoku(char[][] board) {
        Map<Character, Integer>[] row = new HashMap[9];
        Map<Character, Integer>[] col = new HashMap[9];
        Map<Character, Integer>[] box = new HashMap[9];

        for(int i = 0; i < 9; i ++)
        {
            row[i] = new HashMap<>();
            col[i] = new HashMap<>();
            box[i] = new HashMap<>();
        }

        for(int i = 0; i < 9; i ++)
        {
            for(int j = 0; j < 9; j ++)
            {
                if(board[i][j] == '.')
                    continue;
                int box_index = i / 3 * 3 + j / 3;
                row[i].put(board[i][j], row[i].getOrDefault(board[i][j], 0) + 1);
                col[j].put(board[i][j], col[j].getOrDefault(board[i][j], 0) + 1);
                box[box_index].put(board[i][j], box[box_index].getOrDefault(board[i][j], 0) + 1);
                if(row[i].get(board[i][j]) > 1 || col[j].get(board[i][j]) > 1 || box[box_index].get(board[i][j]) > 1)
                    return false;
            }      
        }
        return true;
    }
}

看到一个大神解法，只用一个数组存储，下标i对应的数为数字i出现的行、列、子数独，用一个向量表示。对应位置置为1。例如图中第二行的9，对应的向量就是000000010 000010000 000000010。每次遍历时生成这样一个向量，并与原数组中存的数比较，如果有相同的位那么就说明在同一行/列/子数独有相同的数，返回false。

class Solution {
    public boolean isValidSudoku(char[][] board) {
        int[] vec = new int[10];
        int newIndex = 0;
        for(int i = 0; i < 9; i ++)
        {
            for(int j = 0; j < 9; j ++)
            {
                if(board[i][j] == '.')
                    continue;
                int val = board[i][j] - '0';
                int box_index = i / 3 * 3 + j / 3;
                newIndex = (1 << (i + 0)) | (1 << (j + 9)) | (1 << (box_index + 18));
                if((newIndex & vec[val]) != 0)
                    return false;
                vec[val] |= newIndex;
            }
        }
        return true;
    }
}