算法题：有效的数独

我就是我 2022-12-28 04:14 109阅读 0赞

### 算法题：有效的数独 ###

*  题目描述
 *   *  示例
     *  解释:
     *  说明:
 *  代码
 *  执行效率

# 题目描述 #

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

数字 1-9 在每一行只能出现一次。  
数字 1-9 在每一列只能出现一次。  
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

数独部分空格内已填入了数字，空白格用 ‘.’ 表示。

## 示例 ##

示例 1:  
输入:  
\[  
\[“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:  
输入:  
\[  
\[“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 存在, 因此这个数独是无效的。

## 说明: ##

一个有效的数独（部分已被填充）不一定是可解的。  
只需要根据以上规则，验证已经填入的数字是否有效即可。  
给定数独序列只包含数字 1-9 和字符 ‘.’ 。  
给定数独永远是 9x9 形式的。

# 代码 #

class Solution:
        def isValidSudoku(self, board) -> bool:
            for i in range(9):
                for j in range(9):
                    if board[i][j] != '.':
                        for n in range(1,9-j):
                            if board[i][j] == board[i][j+n]:
                                return False
                        for n in range(1,9-i):
                            if board[i][j] == board[i+n][j]:
                                return False
                    if i%3 == 0 and j %3 ==0:
                        new_list = []
                        for x in range(3):
                            for y in range(3):
                                if board[i+x][j+y] != '.':
                                    new_list.append(board[i+x][j+y])
                        print(new_list)
                        for l in range(len(new_list)):
                            for m in range(1,len(new_list)-l):
                                if new_list[l] == new_list[l+m]:
                                    return False
            return True

# 执行效率 #

507 个测试用例  
执行用时: 188 ms  
内存消耗: 28.1 MB

解题思路及代码来源：博主  
题目来源：力扣（LeetCode）  
题目链接：https://leetcode-cn.com/problems/valid-sudoku/  
题目著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。