0
点赞
收藏
分享

微信扫一扫

LeetCode36-有效的数独

迪莉娅1979 2022-03-11 阅读 63

LeetCode36-有效的数独

Leetcode / 力扣

36. 有效的数独:

注意:

示例 1:
[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-YC3pRvIP-1646656820193)(./pic/36_01.png)]

输入: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:

输入: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 存在, 因此这个数独是无效的。

提示:

解题思路1:

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int vis[15],num;
        
        for(int i=0;i<9;++i) {
            memset(vis,0,sizeof(vis));
            for(int j=0;j<9;++j) {
                if(board[i][j]!='.') {
                    num=board[i][j]-'0';
                    if(vis[num]==1)
                        return false;
                    vis[num]=1;
                }
            }
        }
        
        for(int i=0;i<9;++i) {
            memset(vis,0,sizeof(vis));
            for(int j=0;j<9;++j) {
                if(board[j][i]!='.') {
                    num=board[j][i]-'0';
                    if(vis[num]==1)
                        return false;
                    vis[num]=1;
                }
            }
        }
        
        for(int i=0;i<3;++i) {
            for(int j=0;j<3;++j) {
                memset(vis,0,sizeof(vis));
                for(int k=i*3;k<i*3+3;++k) {
                    for(int l=j*3;l<j*3+3;++l) {
                        if(board[k][l]!='.') {
                            num=board[k][l]-'0';
                            if(vis[num]==1)
                                return false;
                            vis[num]=1;
                        }
                    }
                }
            }
        }
        return true;
    }
};
举报

相关推荐

0 条评论