Leetcode Sudoku Solver python

#

Write a program to solve a Sudoku puzzle by filling the empty cells.

Empty cells is indicated by the character ‘.‘ .

Assume that there would be is only one unique solution.

A Sudoku Puzzle ...

... and its solution numbers marked in red.

Classsolution (object):defSolvesudoku (self, Board):""": Type BOARD:LIST[LIST[STR]]: rtype:void do not return anything, modify board In-place instead. """        defisValid (x, y): tmp=Board[x][y] Board[x][y]='D'             forIinchRange (9):                ifBoard[i][y] = =tmp:returnFalse forIinchRange (9):                ifBoard[x][i] = =tmp:returnFalse forIinchRange (3):                 forJinchRange (3):                    ifboard[(X/3) *3+i][(Y/3) *3+j] = =tmp:returnFalse Board[x][y]=tmpreturnTruedefDFS (board): forIinchRange (9):                 forJinchRange (9):                    ifBOARD[I][J] = ='.':                         forKinch '123456789': Board[i][j]=kifIsValid (I,J) andDFS (board):returnTrue Board[i][j]='.'                        returnFalsereturnTrue DFS (board)

Leetcode Sudoku Solver python