36. Valid Sudoku leetcode Python new season 2016

最新推荐文章于 2017-12-09 16:21:26 发布

hyperbolechi

最新推荐文章于 2017-12-09 16:21:26 发布

阅读量473

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 2016刷题

本文链接：https://blog.youkuaiyun.com/hyperbolechi/article/details/50547339

leetcode 同时被 2 个专栏收录

166 篇文章

订阅专栏

2016刷题

45 篇文章

订阅专栏

本文介绍了一个用于验证数独是否有效的算法实现。该算法检查数独的行、列及每个宫格内数字是否重复，确保符合数独的基本规则。部分填充的数独同样适用此验证方法。

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

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.

The Sudoku board could be partially filled, where empty cells are filled with the character '.'.

A partially filled sudoku which is valid.

Note:

A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be validated.

class Solution(object):
    def valid(self, x, y, tmp, board):
        for i in range(9):
            if board[i][y] == tmp:
                return False
        for j in range(9):
            if board[x][j] == tmp:
                return False
        for i in range(3):
            for j in range(3):
                if board[(x / 3) * 3 + i][( y / 3) * 3 + j] == tmp:
                    return False
        return True
    def isValidSudoku(self, board):
        """
        :type board: List[List[str]]
        :rtype: bool
        """
        for i in range(9):
            for j in range(9):
                if board[i][j] == '.':
                    continue
                tmp = board[i][j]
                board[i][j] = 'D'
                if self.valid(i, j, tmp, board) == False:
                    return False
                board[i][j] = tmp
        return True