【Leetcode长征系列】Valid Sudoku

原题:

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.

The Sudoku board could be partially filled, where empty cells are filled with the character '.'.


A partially filled sudoku which is valid.

Note:
A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be validated.

思路:

首先按行检查,每行的元素中1-9只出现一次

再按列检查,同检查行的规则。

最后3*3的九宫格检查。

代码:

class Solution {
   
public:
    int *stamp = new int[10];
    bool isValidSudoku(vector<vector<char> > &board) {
        for (int i = 0; i<9; i++)   
            if (!isValidrow(board[i])) return false;
        
        return isValidcolumn(board)&&isValidcube(board);
        
    }
    
    bool isValidrow(vector<char> &row){
        for (int i = 0; i<10; i++)  stamp[i] = 0;
        for( int i = 0; i < row.size(); i++){
            if (isValidnum(row[i])) {
                if(stamp[row[i]-'1'] == 0) stamp[row[i]-'1'] = 1;
                else return false;
            }
        }
        return true;
    }
    
    bool isValidcolumn(vector<vector<char>> &board){
        for (int j = 0; j<9; j++){
            
            for (int i = 0; i<9; i++)  stamp[i] = 0;
            
            for (int i = 0; i<9; i++){
                if(isValidnum(board[i][j])){
                    if(stamp[board[i][j]-'1'] == 0) stamp[board[i][j]-'1'] = 1;
                    else return false;
                } 
            }
            
        }
        return true;
    }
    
    bool isValidcube(vector<vector<char>> &board){
        for(int m = 0; m<3; m++){
            for(int k = 0; k<3; k++){
                for (int i = 0; i<10; i++)  stamp[i] = 0; 
                for(int i = m*3; i<(m+1)*3; i++){
                    for(int j = k*3; j<(k+1)*3; j++){
                        if(isValidnum(board[i][j])) {
                            if(stamp[board[i][j]-'1'] == 0) stamp[board[i][j]-'1'] = 1;
                            else return false;
                        }
                    }
                }
            }
        }
        return true;
    }
    
    bool isValidnum(char a){
        if (a>'0'&&a<='9') return true;
        else return false;
    }
};



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值