[leetcode] 36. Valid Sudoku

Description

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.

分析

题目的意思是：验证一个9*9的数独是否是合法的。

• 每遍历到一个数字，需要验证该数字在其对应的行是否合法，列是否合法，在小九宫格里面是否合法。抓住这个就行了。

C++代码

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        if(board.empty()){
            return false;
        }
        int n=board.size();
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if(board[i][j]!='.'){
                    if(!isValid(board,i,j)){
                        return false;
                    }
                }
            }
        }
        return true;
    }
    bool isValid(vector<vector<char>> board,int row,int col){
        int n=board.size();
        for(int i=0;i<n;i++){
            if(board[row][col]==board[i][col]&&row!=i){
                return false;
            }
            if(board[row][col]==board[row][i]&&col!=i){
                return false;
            }
        }
        for(int i=row/3*3;i<row/3*3+3;i++){
            for(int j=col/3*3;j<col/3*3+3;j++){
                if(board[i][j]==board[row][col]&&(i!=row||j!=col)){
                    return false;
                }
            }
        }
        return true;
    }
};

Python 代码

用的方法跟C++的一样，不过我看答案解析还有另一种解法，就是用row数组，col数据，temp数组，把这三种情况的数都存起来，然后遍历的时候，根据这些数组判断是否重复就行了。

class Solution:
    def isValid(self,row,col,board):
        for i in range(len(board)):
            if(board[i][col]==board[row][col] and i!=row):
                return False
            if board[row][i]==board[row][col] and i!=col:
                return False
        for i in range(row//3*3,row//3*3+3,1):
            for j  in range(col//3*3,col//3*3+3,1):
                if board[i][j]==board[row][col] and i!=row:
                    return False
                if board[i][j]==board[row][col] and j!=col:
                    return False
        return True

    def isValidSudoku(self, board: List[List[str]]) -> bool:
        m=len(board)
        n=len(board[0])
        for i in range(m):
            for j in range(n):
                if board[i][j]!='.' and self.isValid(i,j,board)==False:
                    return False
        return True

参考文献

[编程题]valid-sudoku