leetcode 36. valid-sudoku 有效的数独 python3

时间：2020-9-8

题目地址：https://leetcode-cn.com/problems/valid-sudoku/

题目难度：Medium

题目描述：

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

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 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：遍历数独三次

写了一上午，边划水边写

代码段1：通过

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        # each row
        flag = self.is_valid(board)
        if flag == False:
                return flag
       
        # each col
        change_board = list(map(list, zip(*board)))
        flag = self.is_valid(change_board)
        if flag == False:
                return flag
    
        # each block
        for base in range(0, 7, 3):
            block_board = []
            for i in range(3):
                for j in range(3):
                    block_board.append(board[i + base][j])
            print(block_board)
            temp = []
            for i in block_board:
                if i != '.':
                    temp.append(i)
            flag = len(temp) == len(set(temp))
            print(flag)
            if flag == False:
                return flag
            
            #block_board.is_valid
        for base in range(0, 7, 3):
            block_board = []
            for i in range(3):
                for j in range(3,6):
                    block_board.append(board[i + base][j])
            
            print(block_board)
            temp = []
            for i in block_board:
                if i != '.':
                    temp.append(i)
            flag = len(temp) == len(set(temp))
            print(flag)
            if flag == False:
                return flag
        
        for base in range(0, 7, 3):
            block_board = []
            for i in range(3):
                for j in range(6, 9):
                    block_board.append(board[i + base][j])
            print(block_board)
            temp = []
            for i in block_board:
                if i != '.':
                    temp.append(i)
            flag = len(temp) == len(set(temp))
            print(flag)
            if flag == False:
                return flag
        return True

    def is_valid(self, a_list):
        for each in a_list:
            each1, each2 = [], set()
            for i in each:
                if i != '.':
                    each1.append(i)
                    each2.add(i)
            if len(each1) != len(each2):
                return False
        return True

总结：

1. 只要我的方法足够烂，这题就难不倒我

---

后续优化：一次遍历https://leetcode-cn.com/problems/valid-sudoku/solution/you-xiao-de-shu-du-by-leetcode/