Leetcode 36 Valid Sudoku

Andrew9tech

于 2015-05-21 18:40:30 发布

阅读量573

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode刷题

本文链接：https://blog.youkuaiyun.com/Andrew9Tech/article/details/45895509

Leetcode刷题专栏收录该内容

38 篇文章

订阅专栏

本文介绍了一个利用三次9*9循环检查数独矩阵有效性的算法，确保每个行、列和3x3宫格内数字不重复。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

三次9*9 循环，效率不高吧

class Solution:
    # @param {character[][]} board
    # @return {boolean}
    def isValidSudoku(self, board):
        if len(board)!=9 or len(board[0])!=9:
            return False
        for i in xrange(9):
            map=[0 for k in range(10)]
            for j in xrange(9):
                if board[i][j]=='.': continue
                if board[i][j]<'0' or board[i][j]>'9': 
                    return False
                num = int(board[i][j])
                if map[num]==1: return False
                else: map[num]=1
        
        for j in xrange(9):
            map=[0 for k in range(10)]
            for i in xrange(9):
                if board[i][j]=='.': continue
                num = int(board[i][j])
                if map[num]==1: return False
                else: map[num]=1
                
        for i in xrange(0, 9, 3):
            for j in xrange(0, 9, 3):
                map=[0 for k in range(10)]
                for p in xrange(i, i+3):
                    for q in xrange(j, j+3):
                        if board[p][q]=='.': continue
                        num = int(board[p][q])
                        if map[num]==1: return False
                        else: map[num]=1
        return True