leetcode:有效的数独

题目:有效的数独

link: https://leetcode.cn/problems/valid-sudoku/description/?envType=study-plan-v2&envId=top-interview-150

    def isValidSudoku(self, board: List[List[str]]) -> bool:

        rows = [[0 for i in range(9)] for j in range(9)]
        coloumns = [[0 for i in range(9)] for j in range(9)]

        sub = [[[0 for _ in range(9)] for i in range(3)] for j in range(3)]

        for i in range(9):
            for j in range(9):
                ss = board[i][j]
                if ss!=".":
                    index = int(ss) - 1
                    rows[i][index] += 1
                    coloumns[j][index] += 1
                    # print(i//3,j//3,index)
                    sub[i//3][j//3][index] += 1
                    if(rows[i][index]>1 or coloumns[j][index]>1 or sub[i//3][j//3][index]>1):
                        # print(rows,coloumns,sub)
                        return False
        return True
        ```
posted @   xiaoxinlong  阅读(4)  评论(0编辑  收藏  举报
相关博文:
阅读排行:
· 在鹅厂做java开发是什么体验
· 百万级群聊的设计实践
· WPF到Web的无缝过渡:英雄联盟客户端的OpenSilver迁移实战
· 永远不要相信用户的输入:从 SQL 注入攻防看输入验证的重要性
· 全网最简单!3分钟用满血DeepSeek R1开发一款AI智能客服,零代码轻松接入微信、公众号、小程
AmazingCounters.com
点击右上角即可分享
微信分享提示