[LeetCode] Sudoku Solver

Write a program to solve a Sudoku puzzle by filling the empty cells.

Empty cells are indicated by the character '.'.

You may assume that there will be only one unique solution.


A sudoku puzzle...


...and its solution numbers marked in red.

class Solution {
public:
    bool isVaild(vector<vector<char> > &board,int a,int b){
        for(int row = 0;row < 9;row ++){
            if(row != a && board[a][b] == board[row][b])
                return false;
        }
        for(int column = 0;column < 9;column ++){
            if(column != b && board[a][b] == board[a][column])
                return false;
        }
        int x = (a/3)*3 ,y = (b/3)*3;
        for(int i = 0;i < 3;i ++){
            for(int j = 0;j < 3;j ++){
                if(x + i!= a && y + j!= b && board[a][b] == board[x + i][y + j])
                    return false;
            }
        }
        return true;
    }
    
    bool generate(vector<vector<char> > &board){
        for(int i = 0;i < 9;i ++){
            for(int j = 0;j < 9;j ++){
                if(board[i][j] == '.'){
                    for(int k = 1;k <= 9;k ++){
                        board[i][j] = k + '0';
                        if(isVaild(board, i, j) && generate(board))
                            return true;
                        board[i][j] = '.';
                    }
                    return false;
                }
            }
        }
        return true;
    }
    void solveSudoku(vector<vector<char> > &board) {
        generate(board);
    }
};


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值