LeetCode 36. Valid Sudoku

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

1. Each row must contain the digits 1-9 without repetition.
2. Each column must contain the digits 1-9 without repetition.
3. Each of the 9 3x3 sub-boxes of the grid must contain the digits 1-9 without repetition.

A partially filled sudoku which is valid.

The Sudoku board could be partially filled, where empty cells are filled with the character '.'.

Example 1:

Input:
[
  ["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"]
]
Output: true

Example 2:

Input:
[
  ["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"]
]
Output: false
Explanation: Same as Example 1, except with the 5 in the top left corner being 
    modified to 8. Since there are two 8's in the top left 3x3 sub-box, it is invalid.

Note:

• A Sudoku board (partially filled) could be valid but is not necessarily solvable.
• Only the filled cells need to be validated according to the mentioned rules.
• The given board contain only digits 1-9 and the character '.'.
• The given board size is always 9x9.

解题思路:

题目要求判断时候为有效的数独满足三点

1. 行中数字没有重复
2. 列中数字没有重复
3. 九个小方格中数字没有重复

对此我们对上述的三个要求进行判断即可 ，使用Hashset 中的add方法成功添加返回true ,否则返回false，第一 第二两个要求比较容易判断，关键的是如何表示九个小格中的数字是否重复

i对应每个小方格 通过 row col 表示每个小方格的起始位置 通过 j / 3， j % 3表示下方格中的行 列值， 依次判断。 这样就判断了9的小方格中是否出现重复。

public class Solution {
    public boolean isValidSudoku(char[][] board) {
        for (int i = 0; i < board.length; i++){
            HashSet<Character> row = new HashSet<>();
            HashSet<Character> col = new HashSet<>();
            HashSet<Character> grid = new HashSet<>();
            for (int j = 0; j < board[i].length; j++){
                if (board[i][j] != '.' && !row.add(board[i][j] )) return  false;
                if (board[j][i] != '.' && !col.add(board[j][i] )) return  false;
                int rowindex = (i / 3) * 3;
                int colindex = (i % 3) * 3;
                if (board[rowindex + j / 3][colindex + j % 3] != '.' && !grid.add(board[rowindex + j / 3][colindex + j % 3]))  return  false;
            }
        }
        return true;
    }
}