Module Expr Str Assign NameStore Str ClassDef bases body FunctionDef arguments args NameParam NameParam defaults body Expr Str For NameStore Call NameLoad Call NameLoad NameLoad body Assign SubscriptStore NameLoad Index NameLoad Call NameLoad SubscriptLoad NameLoad Index NameLoad Expr Call AttributeLoad NameLoad attr NameLoad Num Num For NameStore Call NameLoad Call NameLoad NameLoad body Assign SubscriptStore NameLoad Index NameLoad Call AttributeLoad Str attr SubscriptLoad NameLoad Index NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str Assign NameStore Call NameLoad NameLoad If Call NameLoad ListComp CompareNotEq SubscriptLoad SubscriptLoad NameLoad Index BinOpDiv NameLoad NameLoad Index BinOpMod NameLoad NameLoad Str comprehension NameStore Call NameLoad BinOpMult NameLoad NameLoad body Return NameLoad For NameStore Call NameLoad NameLoad body For NameStore Call NameLoad NameLoad body If CompareEq SubscriptLoad SubscriptLoad NameLoad Index NameLoad Index NameLoad Str body For NameStore Call NameLoad Num Num body Assign NameStore Call NameLoad NameLoad Assign NameStore Call NameLoad ListComp CompareNotEq SubscriptLoad SubscriptLoad NameLoad Index NameLoad Index NameLoad NameLoad comprehension NameStore Call NameLoad NameLoad Assign NameStore Call NameLoad ListComp CompareNotEq SubscriptLoad SubscriptLoad NameLoad Index NameLoad Index NameLoad NameLoad comprehension NameStore Call NameLoad NameLoad Assign NameStore Call NameLoad ListComp CompareNotEq SubscriptLoad SubscriptLoad NameLoad Index BinOpAdd BinOpMult BinOpDiv NameLoad Num Num BinOpDiv NameLoad Num Index BinOpAdd BinOpMult BinOpDiv NameLoad Num Num BinOpMod NameLoad Num NameLoad comprehension NameStore Call NameLoad NameLoad If BoolOpAnd NameLoad NameLoad NameLoad body Assign SubscriptStore SubscriptLoad NameLoad Index NameLoad Index NameLoad NameLoad If UnaryOpNot Call AttributeLoad NameLoad attr NameLoad body Assign SubscriptStore SubscriptLoad NameLoad Index NameLoad Index NameLoad Str orelse Return NameLoad Return NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam defaults body Expr Str If CompareGtE NameLoad Num body Return Call AttributeLoad NameLoad attr NameLoad BinOpAdd NameLoad Num Num If CompareEq NameLoad Num body Return NameLoad If CompareEq SubscriptLoad SubscriptLoad NameLoad Index NameLoad Index NameLoad Str body For NameStore Call NameLoad Num Num body Assign NameStore Call NameLoad NameLoad If BoolOpAnd Call NameLoad ListComp CompareNotEq SubscriptLoad SubscriptLoad NameLoad Index NameLoad Index NameLoad NameLoad comprehension NameStore Call NameLoad Num Call NameLoad ListComp CompareNotEq SubscriptLoad SubscriptLoad NameLoad Index NameLoad Index NameLoad NameLoad comprehension NameStore Call NameLoad Num Call NameLoad ListComp CompareNotEq SubscriptLoad SubscriptLoad NameLoad Index BinOpAdd BinOpMult BinOpDiv NameLoad Num Num BinOpDiv NameLoad Num Index BinOpAdd BinOpMult BinOpDiv NameLoad Num Num BinOpMod NameLoad Num NameLoad comprehension NameStore Call NameLoad Num body Assign SubscriptStore SubscriptLoad NameLoad Index NameLoad Index NameLoad NameLoad If UnaryOpNot Call AttributeLoad NameLoad attr NameLoad NameLoad BinOpAdd NameLoad Num body Assign SubscriptStore SubscriptLoad NameLoad Index NameLoad Index NameLoad Str orelse Return NameLoad orelse Return Call AttributeLoad NameLoad attr NameLoad NameLoad BinOpAdd NameLoad Num Return NameLoad decorator_list decorator_list If CompareEq NameLoad Str body Expr Call AttributeLoad Call NameLoad attr ListLoad Str Str Str Str Str Str Str Str Str
N/A N/A 
Write a program to solve a Sudoku puzzle by filling the empty cells.

Empty cells are indicated by the character '.'.

You may assume that there will be only one unique solution.
 N/A __author__ Danyang Solution N/A N/A solveSudoku N/A N/A self board N/A N/A N/A 
        Solve the Sudoku by modifying the input board in-place.

        NP question: N-Queens, Combination Sum, Combinations, Permutations

        :param board: a 9x9 2D array
        :return: NIL
         N/A row N/A xrange N/A len board N/A N/A N/A board N/A row N/A list N/A board N/A row N/A N/A N/A self solve board 0 0 N/A row N/A xrange N/A len board N/A N/A N/A board N/A row N/A N/A join N/A board N/A row N/A solve_TLE N/A N/A self board N/A N/A N/A 

        :param board: a 9x9 2D array
        :return: Boolean
         N/A n N/A len board N/A N/A all N/A N/A N/A N/A board N/A N/A i n N/A N/A i n . N/A i N/A xrange N/A n n N/A N/A True N/A i N/A xrange n N/A N/A j N/A xrange n N/A N/A N/A N/A N/A board N/A i N/A j . N/A N/A num N/A range 1 10 N/A N/A num_str N/A str num N/A condition_row N/A all N/A N/A N/A N/A board N/A i N/A col num_str N/A col N/A xrange n N/A condition_col N/A all N/A N/A N/A N/A board N/A row N/A j num_str N/A row N/A xrange n N/A condition_square N/A all N/A N/A N/A N/A board N/A N/A N/A N/A i 3 3 N/A count 3 N/A N/A N/A N/A j 3 3 N/A count 3 num_str N/A count N/A xrange n N/A N/A condition_col condition_row condition_square N/A N/A N/A N/A board N/A i N/A j num_str N/A N/A N/A N/A self solve board N/A N/A N/A N/A board N/A i N/A j . N/A N/A True N/A False N/A solve N/A N/A self board i j N/A N/A N/A 
        dfs
        :param board: a 9x9 2D array
        :return: Boolean
         N/A N/A j 9 N/A N/A N/A N/A self solve board N/A i 1 0 N/A N/A i 9 N/A N/A True N/A N/A N/A N/A board N/A i N/A j . N/A N/A num N/A range 1 10 N/A N/A num_str N/A str num N/A N/A N/A all N/A N/A N/A N/A board N/A i N/A col num_str N/A col N/A xrange 9 N/A all N/A N/A N/A N/A board N/A row N/A j num_str N/A row N/A xrange 9 N/A all N/A N/A N/A N/A board N/A N/A N/A N/A i 3 3 N/A count 3 N/A N/A N/A N/A j 3 3 N/A count 3 num_str N/A count N/A xrange 9 N/A N/A N/A N/A board N/A i N/A j num_str N/A N/A N/A N/A self solve board i N/A j 1 N/A N/A N/A N/A board N/A i N/A j . N/A N/A True N/A N/A N/A N/A self solve board i N/A j 1 N/A False N/A N/A N/A N/A __name__ __main__ N/A N/A N/A N/A N/A Solution solveSudoku N/A ..9748... 7........ .2.1.9... ..7...24. .64.1.59. .98...3.. ...8.3.2. ........6 ...2759..