Valid Sudoku Leetcode Python

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.

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

A partially filled sudoku which is valid.

Sudoku的要求有三条：每行的数只出现一次，每列的数只出现一次，每个九宫格数只出现一次。

所以我们要验证这三个条件逐个遍历一遍。

The rules for Sudoku is number from 1-9 appear only once in every row and column. number from 1-9 only appear once in a 3x3 grid.

The time complexity is O(3*n^2 )

class Solution:
    # @param board, a 9x9 2D array
    # @return a boolean
    def valid(self,x,y,tmp,board):
        for i in range(9):
            if board[i][y]==tmp:
                return False
        for j in range(9):
            if board[x][j]==tmp:
                return False
        for i in range(3):
            for j in range(3):
                if board[(x/3)*3+i][(y/3)*3+j]==tmp:
                    return False
        return True
    def isValidSudoku(self, board):
        for i in range(9):
            for j in range(9):
                if board[i][j]=='.':
                    continue
                tmp=board[i][j]
                board[i][j]='D'
                if self.valid(i,j,tmp,board)==False:
                    return False
                else:
                    board[i][j]=tmp
        return True