36.有效的数独（python3）（含注释）

题目：

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

1. 数字 1-9 在每一行只能出现一次。
2. 数字 1-9 在每一列只能出现一次。
3. 数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）

注意：

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

示例 1：

输入：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"]]
输出：true

示例 2：

输入：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"]]
输出：false
解释：除了第一行的第一个数字从 5 改为 8 以外，空格内其他数字均与 示例1 相同。 但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。

提示：

• board.length == 9
• board[i].length == 9
• board[i][j] 是一位数字（1-9）或者 '.'

思路： 

        首先先判断这个大的数独的每一行或者每一列有没有重复的元素（注意这里先把“.”给去除），如果有的话就直接输出False，如果没有再查看每一个九宫格里面有没有重复的元素（同样去除"."），如果有的话输出False否则True。

具体的执行看代码，我把代码没有写成class的形式的原因是：方便大家再pycharm中debug一下看看每一步是怎样运行的，有助于大家理解这道题。

代码： 

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"]]
flag = True #判断数独是否有效
for i in range(len(board)):
    l3 = []  # 每一列的元素
    for j in range(len(board)):
        l3.append(board[j][i])
        while "." in l3:
            l3.remove('.')
        if len(set(l3)) < len(l3): #判断每一列有没有重复的元素
            flag = False
for i in range(len(board)):
    l2 = []  # 用来储存行的元素
    l2.extend(board[i])
    while "." in l2:
        l2.remove('.')
    if len(set(l2)) < len(l2):
        flag = False
for i in range(0,len(board),3):
    for j in range(0,len(board),3):
        l1 = [] #用来储存每个九宫格里面的数据
        for m in range(i,i+3): #循环每一个九宫格把他储存在l1中
            for n in range(j,j+3):
                l1.append(board[m][n])
        #先判断九宫格里面的数据是否合格
        while "." in l1:
            l1.remove('.')
        if len(set(l1)) < len(l1):
            flag = False
print(flag)

 运行结果：