36有效的数独

最新推荐文章于 2024-10-31 09:04:32 发布

CervoLu

最新推荐文章于 2024-10-31 09:04:32 发布

阅读量66

点赞数

分类专栏： LeetCode 文章标签： c++ 算法

本文链接：https://blog.csdn.net/qq_50523689/article/details/121395210

版权

LeetCode 专栏收录该内容

57 篇文章 0 订阅

订阅专栏

我用三个9*9的矩阵存储9行，9列，9个box里，1~9出现过的情况，值得注意的是，board[i][j]是char各式，想要其作为下标索引，需要做这步处理

row[i][board[i][j]-'0'-1] ++;

完整代码如下

#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int row[9][9] = { 0 };
        int column[9][9] = { 0 };
        int box[9][9] = { 0 };
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                if (board[i][j] != '.') {//单引号为字符，双引号为字符串
                    row[i][board[i][j]-'0'-1] ++;
                    column[j][board[i][j]-'0'-1] ++;
                    box[(i / 3) * 3 + (j / 3)][board[i][j]-'0'-1] ++;
                    if (row[i][board[i][j]-'0'-1] == 2 || column[j][board[i][j]-'0'-1] == 2 || box[(i / 3) * 3 + (j / 3)][board[i][j]-'0'-1] == 2) {
                        return false;
                    }
                }
            }
        }
        return true;
    }
};
int main() {
    Solution test;
    vector<vector<char>>board =
    { {'5','9','.','.','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'} };
    cout << test.isValidSudoku(board);
}