【E】【59】【leetcode题解】Valid Sudoku

175 篇文章 0 订阅
157 篇文章 0 订阅

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.

Subscribe to see which companies asked this question

横着,竖着,3*3方块,挨个判断,逻辑比较简单






class Solution(object):
    def isValidSudoku(self, board):
        zeros = [0]*10
        res = zeros[:]
        b = board


        #横排的
        for i in b:
            #print max(i)
            for j in i:
                #print j
                if j == '.':
                    continue
                else:
                    res[int(j)] += 1
            #print res
            if max(res) > 1:
                return False
            res = zeros[:]

        #竖排的
        for j in range(0,9):
            for i in range(0,9):
                if b[i][j] == '.':
                    continue
                else:
                    res[int(b[i][j])] += 1
            #print res
            if max(res) > 1:
                return False
            res = zeros[:]


        for i in range(0,9,3):
            for j in range(0,9,3):
                #print i,j
                try:
                    #print int(b[i][j])
                    if b[i][j] != '.':
                        res[int(b[i][j])] += 1

                    if b[i][j+1] != '.':
                        res[int(b[i][j+1])] += 1

                    if b[i][j+2] != '.':
                        res[int(b[i][j+2])] += 1

                    if b[i+1][j] != '.':
                        res[int(b[i+1][j])] += 1

                    if b[i+1][j+1] != '.':
                        res[int(b[i+1][j+1])] += 1

                    if b[i+1][j+2] != '.':
                        res[int(b[i+1][j+2])] += 1

                    if b[i+2][j] != '.':
                        res[int(b[i+2][j])] += 1

                    if b[i+2][j+1] != '.':
                        res[int(b[i+2][j+1])] += 1

                    if b[i+2][j+2] != '.':
                        res[int(b[i+2][j+2])] += 1

                    #print res   
                    if max(res) > 1:
                        return False 
                    res = zeros[:]
                except:
                    continue



        return True


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值