leetcode 36 有效的数独 （c++和python）

 

目录

题目描述：

解题思路： 

C++代码： 

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 形式的。

解题思路： 

哈希表。标志二维数组。

1) 二维数组rows[i][8]: 表示第i行，出现过数字8;

2) 同理，二维数组cols[j][5]：表示第j列，出现过数字5;

3) 同理，二维数组blocks[m][3]: 表示第m个块，出现过数字3，其中m = 3*(i / 3) + j / 3.

注意：后面数字8,5,3都是int类型，而传入的是char类型，所以需要进行类型转换.

C++代码： 

 执行用时：20 ms, 在所有 C++ 提交中击败了54.39%的用户

内存消耗：19.3 MB, 在所有 C++ 提交中击败了16.63%的用户

通过测试用例：507 / 507

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        // 定义3个哈希表，即3个标志二维数组，记录是否存在某个数字，也可以改写成记录次数.
        vector<vector<int>> rows(9, vector<int>(9));  // 二维数组，行出现
        vector<vector<int>> cols(9, vector<int>(9));  // 列出现
        vector<vector<int>> blocks(9, vector<int>(9));  // 块出现

        // 遍历一次
        for (int i = 0; i < board.size(); i++)
            for (int j = 0; j < board[0].size(); j++)
                if ('1' <= board[i][j] && board[i][j] <= '9')
                {
                    int cur = board[i][j] - '1';  // 后面curr要作为索引，-1使得索引范围为[0,8]
                    if (rows[i][cur] || cols[j][cur] || blocks[3*(i/3)+j/3][cur]) return false;
                    rows[i][cur] = true;
                    cols[j][cur] = true;
                    blocks[3*(i/3)+(j/3)][cur] = true;
                }
                

        return true;
    }
};

python

执行用时：40 ms, 在所有 Python 提交中击败了30.35%的用户

内存消耗：13.2 MB, 在所有 Python 提交中击败了18.36%的用户

通过测试用例：507 / 507

class Solution(object):
    def isValidSudoku(self, board):
        """
        :type board: List[List[str]]
        :rtype: bool
        """
        row_list = [[0 for j in range(9)] for i in range(9)]  # [[0] * 9] * 9,如果是这样，只是创建了指向相同地址的引用
        col_list = [[0 for j in range(9)] for i in range(9)]
        block_list = [[0 for j in range(9)] for i in range(9)]

        for i in range(9):
            for j in range(9):
                if board[i][j] != '.':
                    cur = int(board[i][j]) - 1
                    if row_list[i][cur] or col_list[j][cur] or block_list[3 * (i // 3) + j // 3][cur]:
                        return False
                    row_list[i][cur] = True
                    col_list[j][cur] = True
                    block_list[3 * (i // 3) + j // 3][cur] = True

        return True