《中英双解》leetCode Valid Sudoku(有效的数独)

Determine if a 9 x 9 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 nine 3 x 3 sub-boxes of the grid must contain the digits 1-9 without repetition.

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.

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

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）
数独部分空格内已填入了数字，空白格用 '.' 表示。

注意：

一个有效的数独（部分已被填充）不一定是可解的。
只需要根据以上规则，验证已经填入的数字是否有效即可。

Example 1:

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

Example 2:

Input: 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"]]
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.

Constraints:

• board.length == 9
• board[i].length == 9
• board[i][j] is a digit 1-9 or '.'.

生词：

valid
英 [ˈvælɪd]   美 [ˈvælɪd]  
adj.
(法律上)有效的;(正式)认可的;符合逻辑的;合理的;有根据的;确凿的;有效的;系统认可的

cells
英 [sɛlz]   美 [sɛlz]  
n.
单间牢房;牢房;(修道士或修女住的)小房间;细胞

repetition
英 [ˌrepəˈtɪʃn]   美 [ˌrepəˈtɪʃn]  
n.
重复;重做;重说;重做的事;重说的话

grid
英 [ɡrɪd]   美 [ɡrɪd]  
n.
网格;方格;(金属或木制的)格子，格栅，栅栏;(地图上的)坐标方格

solvable
英 [ˈsɒlvəbl]   美 [ˈsɑlvəbəl]  
可解的;可解决的;可解决;可解;可解群

这题怎么说呢？不怕大家说，我刚开始的思路就是一个一个遍历，先遍历行，再遍历列，再遍历那个小的九宫格，就是代码有点复杂。

class Solution {
    public boolean isValidSudoku(char[][] board) {
        for(int i = 0;i < board.length;i++){
            for(int j = 0;j < board[0].length;j++){
                if(board[i][j] >= '0' && board[i][j] <= '9'){
                  if(!isTrue(i,j,board)) return false;
                }
            }
        }
        return true;
    }
    
    public boolean isTrue(int i,int j,char[][] board){
        for(int k = 0;k < board[i].length;k++){
            if(board[i][k] == board[i][j] && k != j) return false;
        }
         for(int k = 0; k < board.length; k++){
            if(board[k][j] == board[i][j] && k != i){
                return false;
            }
        }
        // 验证当前 3 * 3 数组
        int heng = (i / 3) * 3;
        int zhong = (j / 3) * 3;

        for(int k1 = heng; k1 < heng + 3; k1++){
            for(int k2 = zhong; k2 < zhong + 3; k2++){
                if((board[k1][k2] == board[i][j]) && (k1 != i && k2 != j)){
                    return false;
                }
            }
        }
        return true;
    }
}