leetcode 36 有效的数独

最新推荐文章于 2022-03-06 10:14:48 发布

我的脚印

最新推荐文章于 2022-03-06 10:14:48 发布

阅读量89

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_28640193/article/details/101020431

版权

leetcode 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

leetcode 36 有效的数独

题目

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

来源：力扣（LeetCode）

解法

拿到题的第一反应就是用数组标记数字然后重复标记了的话 return false

行和列的话很简单直接就可以处理重点是每个3*3的小格子怎么处理

首先先将每个3*3的格子编号

就可以找到规律

格子编号 = i/3*3+j/3；

所以这道题出来啦将读入的每个数字都做好标记标记重复了就跳出

ps: 由于给的是字符所以记得 - ‘0’ 转换成数字

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int rows[9][10];
        int columns[9][10];
        int boxes[9][10];
        memset(rows,0,sizeof(rows));
        memset(columns,0,sizeof(columns));
        memset(boxes,0,sizeof(boxes));
        for(int i = 0;i < 9;i++){
            for(int j = 0;j < 9;j++){
                if(board[i][j]!='.'){
                    int num = board[i][j] - '0';
                    int boxIndex = i / 3 * 3 + j / 3;
                    rows[i][num] += 1;
                    columns[j][num] += 1;
                    boxes[boxIndex][num] += 1;
                    if(rows[i][num]==2||columns[j][num]==2||boxes[boxIndex][num]==2)
                        return false;
                }
            }
        }
        return true;
    }
};