LeetCode#36. 有效的数独

题目:

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

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 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）或者 '.'

来源：力扣（LeetCode）
链接：力扣

我个人认为这道题主要是数独判断的第三个条件比较困难，前两个条件看代码就应该能明白原理，我们主要讲一下第三的条件的判断过程。

我们先创造一个字符串，下面的方法中会用到。

store="0123456789"

条件一:

        for i in board:
            for j in store:
                num=i.count(j)
                if num>1:
                    return False

条件二:

        nums=0
        while nums < 9:
            ls=[]
            for i in board:
                ls.append(i[nums])
            for j in store:
                if ls.count(j)>1:
                    return False
            nums+=1

条件三:

我们知道每个数独的矩阵有9个小正方体矩阵，所以我们可以想一个方法，每次判断一个小正方体矩阵是否合格，这样的话就一共要判断9次（这样就是循环9次）。

再细分，每三个小正方形矩阵在一行里，所以我们可以每一行里再判断三次（循环3次）。

通过这样，借助与方法二（建立另外的列表）同样的方法，我们就可以判断我们的每个小正方形是否合格了。

在此，我创造了两个变量来辅助进行循环，line:表示索引的行数 ; lis:表示索引的列数。

        line=0;lis=0;ll=[]
        for i in range(3):  #循环三大行（一大行对应三小行）
            for i in range(3):  #每个大行（三小行），循环三次,3乘3等于9
                for j in board[line:line+3]:
                    for k in j[lis:lis+3]:
                        ll.append(k)
                for m in store:
                    if ll.count(m)>1:
                        return False
                lis+=3 #列数前进三，进入该大行的下一个正方体矩阵
                ll=[]  #注意判断每个小正方体矩阵后，将列表清零
            lis=0    #每循环一大行后，列数归零
            line+=3  #前进一大行

 最后,如果以上判断后都没有返回False,那么这就是一个有效的数独，我们在结尾处返回True即可。

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        store="123456789"
        for i in board:
            for j in store:
                num=i.count(j)
                if num>1:
                    return False
        nums=0
        while nums < 9:
            ls=[]
            for i in board:
                ls.append(i[nums])
            for j in store:
                if ls.count(j)>1:
                    return False
            nums+=1
        line=0;lis=0;ll=[]
        for i in range(3):
            for i in range(3):
                for j in board[line:line+3]:
                    for k in j[lis:lis+3]:
                        ll.append(k)
                for m in store:
                    if ll.count(m)>1:
                        return False
                lis+=3 
                ll=[]
            lis=0
            line+=3
        return True