leetcode 数独判断

遇事不决
慢慢写呗。。。。

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        a=dict()
        b=dict()
        c=dict()
        m=0
        for i in range(0,9):
            a.clear()
            b.clear()
            for j in range (0,9):
                if board[i][j]=='.':
                    pass
                elif board[i][j] in a.values():
                    return False
                else:
                    a[j]=board[i][j]
                if board[j][i]=='.':
                    pass
                elif board[j][i] in b.values():
                    return False
                else :
                    b[j]=board[j][i]
        c.clear()
        for i in range(0,3):
            for j in range(0,3):
                if board[i][j] == '.':
                    pass
                elif board[i][j] in c.values():
                    return False
                else:
                    m=m+1
                    c[m]=board[i][j]
            
            
        c.clear()
        for i in range(0,3):
            for j in range(3,6):
                if board[i][j] == '.':
                    pass
                elif board[i][j] in c.values():
                    return False
                else:
                    m=m+1
                    c[m]=board[i][j]
        c.clear()
        for i in range(0,3):
            for j in range(6,9):
                if board[i][j] == '.':
                    pass
                elif board[i][j] in c.values():
                    return False
                else:
                    m=m+1
                    c[m]=board[i][j]
        c.clear()
        for i in range(3,6):
            for j in range(0,3):
                if board[i][j] == '.':
                    pass
                elif board[i][j] in c.values():
                    return False
                else:
                    m=m+1
                    c[m]=board[i][j]
        c.clear()
        for i in range(3,6):
            for j in range(6,9):
                if board[i][j] == '.':
                    pass
                elif board[i][j] in c.values():
                    return False
                else:
                    m=m+1
                    c[m]=board[i][j]
        c.clear()
        for i in range(6,9):
            for j in range(0,3):
                if board[i][j] == '.':
                    pass
                elif board[i][j] in c.values():
                    return False
                else:
                    m=m+1
                    c[m]=board[i][j]
        c.clear()
        for i in range(6,9):
            for j in range(3,6):
                if board[i][j] == '.':
                    pass
                elif board[i][j] in c.values():
                    return False
                else:
                    m=m+1
                    c[m]=board[i][j]
        c.clear()
        for i in range(6,9):
            for j in range(6,9):
                if board[i][j] == '.':
                    pass
                elif board[i][j] in c.values():
                    return False
                else:
                    m=m+1
                    c[m]=board[i][j]
        c.clear()
        for i in range(3,6):
            for j in range(3,6):
                if board[i][j] == '.':
                    pass
                elif board[i][j] in c.values():
                    return False
                else:
                    m=m+1
                    c[m]=board[i][j]
       
        return True

不就是重复九次嘛
还是想不到怎么整合到一个循环里

也算是浅浅地用了一下刚刚学的hash table了
数据
速度还行

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值