[LeetCode Python3] 36. Valid Sudoku

Python3 Solution:

class Solution:
    def isvalid(self, board, ch, i, j):
        for k in range(9):
            if board[k][j] == ch:
                return False
        for k in range(9):
            if board[i][k] == ch:
                return False
        indexa = i // 3 * 3
        indexb = j // 3 * 3
        for ii in range(indexa, indexa+3):
            for jj in range(indexb, indexb+3):
                if board[ii][jj] == ch:
                    return False
        return True

    def isValidSudoku(self, board: List[List[str]]) -> bool:
        """
        Do not return anything, modify board in-place instead.
        """
        for i in range(9):
            for j in range(9):
                if board[i][j] == ".":
                    continue
                tmp = board[i][j]
                board[i][j] = '.'
                if not self.isvalid(board, tmp, i, j):
                    return False
                board[i][j] = tmp
        return True
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值