[leetcode] Valid Sudoku

最新推荐文章于 2024-10-13 18:33:13 发布

xuxumoi

最新推荐文章于 2024-10-13 18:33:13 发布

阅读量256

点赞数

本文链接：https://blog.csdn.net/xsloop/article/details/46685801

版权

LeetCode 专栏收录该内容

107 篇文章 0 订阅

订阅专栏

class Solution {
public:
    const int LEN = 9;
    bool isValidSudoku(vector<vector<char>>& board) {
        //check rows & cols
        for(int j =0;j<LEN;j++)
        {
            bool check[LEN+1] = {false};
            bool checkcol[LEN+1] = {false};
            for(int i = 0;i<LEN;i++)
            {
                if(board[i][j]!='.')
                {
                    int ti = (board[i][j] - '0');
                    if(check[ti])
                        return false;
                    else
                        check[ti] = true;
                }
                
                if(board[j][i]!='.')
                {
                    int ti = (board[j][i] - '0');
                    if(checkcol[ti])
                        return false;
                    else
                        checkcol[ti] = true;
                }
            }
        }

        
        //check nine box
       
        for(int m = 0;m<3;m++)
        {
            for(int k = 0;k<3;k++)
             {  
                 bool check[LEN+1] = {false};
                 for(int i =0 + 3*k;i<LEN/3+3*k;i++)
                {
                    for(int j = 0 + 3*m;j<LEN/3+3*m;j++)
                    {
                        if(board[i][j]!='.')
                        {
                            int ti = (board[i][j] - '0');
                            if(check[ti])
                                return false;
                            else
                                check[ti] = true;
                        }
                    }
                }
             }
        }
        
        return true;

    }
};