LeetCode_初级算法_数组_有效的数独

问题复述：

判断一个 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的key，这应该会影响速度

比较快的方法是对字符串进行减法都减去一个标杆字符，比如说‘a’，这样进行映射的话速度就会更快一点。

代码：

class Solution {
        public boolean horizontal(char[][] board) {
        for (int i = 0; i < 9; i++) {
            Map<Character, Boolean> map = new HashMap<Character, Boolean>();
            for (int j = 0; j < 9; j++) {
                if (board[i][j] == '.') {
                    continue;
                } else {
                    if (map.containsKey(board[i][j])) {
                        return false;
                    } else {
                        map.put(board[i][j], true);
                    }
                }
            }
        }
        return true;
    }

    public boolean vertical(char[][] board) {
        for (int i = 0; i < 9; i++) {
            Map<Character, Boolean> map = new HashMap<Character, Boolean>();
            for (int j = 0; j < 9; j++) {
                if (board[j][i] == '.') {
                    continue;
                } else {
                    if (map.containsKey(board[j][i])) {
                        return false;
                    } else {
                        map.put(board[j][i], true);
                    }
                }
            }
        }
        return true;
    }

    public boolean partern(char[][] board) {
        for (int i = 0; i < 9; i++) {
            int[][] vctor = new int[][]{{1,1},{1,4},{1,7},{4,1},{4,4},{4,7},{7,1},{7,4},{7,7}};
            Map<Character, Boolean> map = new HashMap<Character, Boolean>();
            int x = vctor[i][0];
            int y = vctor[i][1];
            for (int j = x-1; j < x+2; j++) {
                for (int k = y - 1; k < y + 2; k++) {
                    if (board[j][k] == '.') {
                        continue;
                    } else {
                        if (map.containsKey(board[j][k])) {
                            return false;
                        } else {
                            map.put(board[j][k], true);
                        }
                    }
                }
            }
        }
        return true;
    }
    public boolean isValidSudoku(char[][] board) {
        return vertical(board) && horizontal(board) && partern(board);

    }
}