36. 有效的数独【 力扣(LeetCode) 】

一、题目描述

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

数字 1-9 在每一行只能出现一次。

数字 1-9 在每一列只能出现一次。

数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。(请参考示例图)

注意:

  • 一个有效的数独(部分已被填充)不一定是可解的。
  • 只需要根据以上规则,验证已经填入的数字是否有效即可。
  • 空白格用 '.' 表示。

二、测试用例

示例 1:

cpp 复制代码
输入:board = 
[["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:

cpp 复制代码
输入:board = 
[["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 存在, 因此这个数独是无效的。

提示:

cpp 复制代码
board.length == 9
board[i].length == 9
board[i][j] 是一位数字(1-9)或者 '.'

三、解题思路

  1. 基本思路:
      一力破万法,检查是否满足数独的三个条件就可以了。
  2. 具体思路:一次遍历就可以检查三个条件,就是需要一些技巧。
    • 行唯一:判断每一行中出现的数字是否唯一 【正常遍历】
    • 列唯一:判断每一列中出现的数字是否唯一 【行列交换】
    • 九宫格唯一:判断每一个九宫格中出现的数字是否唯一 【特殊映射】

四、参考代码

时间复杂度: O ( 1 ) \Omicron(1) O(1)【数独是固定大小的,所以都是常数级复杂度】

空间复杂度: O ( 1 ) \Omicron(1) O(1)【数独是固定大小的,所以都是常数级复杂度】

cpp 复制代码
class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int n = board.size(), m = board[0].size();

        for (int i = 0; i < n; i++) {
            vector<vector<bool>> num(3, vector<bool>(m, false));

            for (int j = 0; j < m; j++) {  // 行唯一
                if (board[i][j] != '.') {
                    if (num[0][board[i][j] - '1']) {
                        return false;
                    } else {
                        num[0][board[i][j] - '1'] = true;
                    }
                }

                if (board[j][i] != '.') {  // 列唯一
                    if (num[1][board[j][i] - '1']) {
                        return false;
                    } else {
                        num[1][board[j][i] - '1'] = true;
                    }
                }

                int r = i / 3 * 3 + j / 3, c = (i % 3) * 3 + j % 3;

                if (board[r][c] != '.') {  // 九宫格唯一
                    if (num[2][board[r][c] - '1']) {
                        return false;
                    } else {
                        num[2][board[r][c] - '1'] = true;
                    }
                }
            }
        }

        return true;
    }
};
相关推荐
踏莎行hyx17 分钟前
使用langchain连接llama.cpp部署的本地deepseek大模型开发简单的LLM应用
c++·ai·langchain·大模型·llama.cpp·deepseek
山河木马24 分钟前
前端学C++可太简单了:双冒号 :: 操作符
前端·javascript·c++
满分观察网友z37 分钟前
从混乱到有序:我用“逐层扫描”法优雅搞定公司组织架构图(515. 在每个树行中找最大值)
后端·算法
Z字小熊饼干爱吃保安42 分钟前
面试技术问题总结一
数据库·面试·职场和发展
满分观察网友z1 小时前
一行代码的惊人魔力:从小白到大神,我用递归思想解决了TB级数据难题(3304. 找出第 K 个字符 I)
后端·算法
运维开发王义杰1 小时前
打破技术债困境:从“保持现状”到成为变革的推动者
运维·职场和发展
字节卷动1 小时前
【牛客刷题】活动安排
java·算法·牛客
乌萨奇也要立志学C++1 小时前
【C++详解】STL-list模拟实现(深度剖析list迭代器,类模板未实例化取嵌套类型问题)
c++·list
yi.Ist1 小时前
数据结构 —— 键值对 map
数据结构·算法
s153352 小时前
数据结构-顺序表-猜数字
数据结构·算法·leetcode