LeetCode-36有效的数独-数组（python）

原题网址：点击打开题目链接

 

判断一个 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 形式的。

分析：题目给出的要求还算简单的，只要求是一个有效的数独 9x9的数组，每个盒子为3x3，验证思路就是验证每一个单元。每个单元里有效的数字1-9有且只有一个，任意一行、一列、一个盒子都是一个单元，即要对每个元素board[i][j]做三次验证。

一、在这一行有效,取column 范围0-8，比较board[i][j]和board[i][column]，如果这个元素合法，只有在column==j的是时候board[i][j]和board[i][column]才相等。

二、在这一列有效，验证思路同上

三、在其所在的盒子里有效，这是很多人头疼的地方，关键在于找到所在盒子左上角第一个元素的坐标，此处盒子为3X3，以i,j坐标为例  (i // 3) * 3，(j// 3) * 3就是我们要找的所在盒子左上角第一个元素的坐标  // 在python里是做整数除法的意思，使用其他语言都有自己的处理方法

class Solution:
    def isValidSudoku(self, board):
        """
        :type board: List[List[str]]
        :rtype: bool
        """
        for i in range(9):
            for j in range(9):
                if board[i][j] == '.':
                    board[i][j] = 0
        for i in range(9):
            for j in range(9):
                if board[i][j] != 0:
                    #check the board[i][j] is valid in i's row
                    for column in range(9):
                        if column != j and board[i][j] == board[i][column]:
                            return False
                    #check the board[i][j] is valid in j's column
                    for row in range(9):
                        if row != i and board[i][j] == board[row][j]:
                            return False
                    #check the board[i][j] is valid in the 3-by-3 box
                    for row in range((i // 3) * 3,(i // 3) * 3 + 3):
                        for col in range((j // 3) * 3,(j // 3) * 3 + 3):
                            if row != i and col != j and board[i][j] == board[row][col]:
                                return False
        return True

题目中给的二维数组的字符型的，我开始做了一点处理，包括把"."换成"0"