LeetCode 题解(231) : Valid Sudoku

本文提供了一个简洁的Python实现方案来验证一个数独盘面是否有效。该方法通过检查每行、每列及每个宫格内的数字是否重复来判断数独盘面的有效性。

题目:

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.

题解:

C++和Java版略显笨重,这里就不给出了。Python版如下

class Solution(object):
    def isValidSudoku(self, board):
        """
        :type board: List[List[str]]
        :rtype: bool
        """
        rows, cols, cells = [[] for i in range(9)], [[]for i in range(9)], [[] for i in range(9)]
        for i in range(len(board)):
            for j in range(len(board[0])):
                e = board[i][j]
                if e != '.':
                    if e in rows[i] or e in cols[j] or e in cells[(i / 3) * 3 + j / 3]:
                        return False
                    else:
                        rows[i].append(e)
                        cols[j].append(e)
                        cells[(i / 3 * 3 + j / 3)].append(e)
        return True
                    

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值