【LeetCode】36有效的数独

题目描述

判断一个 9x9 的数独是否有效。只需要根据以下规则,验证已经填入的数字是否有效即可。

  1. 数字 1-9 在每一行只能出现一次。
  2. 数字 1-9 在每一列只能出现一次。
  3. 数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

上图是一个部分填充的有效的数独。

数独部分空格内已填入了数字,空白格用 '.' 表示。

示例 1:

输入:
[
  ["5","3",".",".","7",".",".",".","."],
  ["6",".",".","1","9","5",".",".","."],
  [".","9","8",".",".",".",".","6","."],
  ["8",".",".",".","6",".",".",".","3"],
  ["4",".",".","8",".","3",".",".","1"],
  ["7",".",".",".","2",".",".",".","6"],
  [".","6",".",".",".",".","2","8","."],
  [".",".",".","4","1","9",".",".","5"],
  [".",".",".",".","8",".",".","7","9"]
]
输出: true

示例 2:

输入:
[
  ["8","3",".",".","7",".",".",".","."],
  ["6",".",".","1","9","5",".",".","."],
  [".","9","8",".",".",".",".","6","."],
  ["8",".",".",".","6",".",".",".","3"],
  ["4",".",".","8",".","3",".",".","1"],
  ["7",".",".",".","2",".",".",".","6"],
  [".","6",".",".",".",".","2","8","."],
  [".",".",".","4","1","9",".",".","5"],
  [".",".",".",".","8",".",".","7","9"]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外,空格内其他数字均与 示例1 相同。
     但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。

说明:

  • 一个有效的数独(部分已被填充)不一定是可解的。
  • 只需要根据以上规则,验证已经填入的数字是否有效即可。
  • 给定数独序列只包含数字 1-9 和字符 '.' 。
  • 给定数独永远是 9x9 形式的。

题目理解

题目的目的是完成查询这个数独是否有效,所以需要判断三种类型:1.每个3*3的宫格是否有效;2.每行9个宫格是否有效;3.每列9个宫格是否有效。如果都有效,说明此刻是有效的数独。

代码(py)

class Solution(object):
    def isValidSudoku(self, board):
        """
        :type board: List[List[str]]
        :rtype: bool
        """
        # 3*3 * 9
        for i in range(3):
            for j in range(3):
                temp = [0 for tt in range(0,10)]
                for k in range(3):
                    for l in range(3):
                        tt = board[i*3+k][j*3+l]
                        if tt != '.':
                            tt = int(tt)
                            if temp[tt] == 0:
                                temp[tt] = 1
                            else:
                                return False
        # 9 row
        for i in range(9):
            temp = [0 for tt in range(0,10)]
            for j in range(9):
                tt = board[i][j]
                if tt != '.':
                    tt = int(tt)
                    if temp[tt] == 0:
                        temp[tt] = 1
                    else:
                        return False
        # 9 col
        for i in range(9):
            temp = [0 for tt in range(0,10)]
            for j in range(9):
                tt = board[j][i]
                if tt != '.':
                    tt = int(tt)
                    if temp[tt] == 0:
                        temp[tt] = 1
                    else:
                        return False
        return True

代码分析:根据三种类型的数独判定方式来判断,然后使用一个list来作为键值判断标记。如果出现过,就标记为1,如果再次出现,说明数独是有问题的,就返回False。

展开阅读全文

没有更多推荐了,返回首页