LeetCode37-解数独

LeetCode37-解数独

Leetcode / 力扣

37. 解数独：

编写一个程序，通过填充空格来解决数独问题。
数独的解法需 遵循如下规则：

• 数字 1-9 在每一行只能出现一次。
• 数字 1-9 在每一列只能出现一次。
• 数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）
  数独部分空格内已填入了数字，空白格用 ‘.’ 表示。

示例 1：

输入：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"]]
输出：[["5","3","4","6","7","8","9","1","2"],["6","7","2","1","9","5","3","4","8"],["1","9","8","3","4","2","5","6","7"],["8","5","9","7","6","1","4","2","3"],["4","2","6","8","5","3","7","9","1"],["7","1","3","9","2","4","8","5","6"],["9","6","1","5","3","7","2","8","4"],["2","8","7","4","1","9","6","3","5"],["3","4","5","2","8","6","1","7","9"]]
解释：输入的数独如上图所示，唯一有效的解决方案如下所示：

提示：

• board.length == 9
• board[i].length == 9
• board[i][j] 是一位数字或者 ‘.’
• 题目数据保证输入数独仅有一个解

解题思路1：

搜索+回溯+剪枝
用row[i][10]数组表示第i行的数字1-9是否用过
用col[j][10]数组表示第j列的数字1-9是否用过
用vis[i/3][j/3][10]数组表示某一个3*3块的数字1-9是否用过

代码如下：

class Solution {
    int col[9][10];
    int row[9][10];
    int vis[3][3][10];
    int flag;
    void dfs(int x,int y,vector<vector<char> >& board) {
        if(y==9) {
            ++x;
            y=0;
        }
        if(x==9) {
            flag=1;
            return ;
        }
        //printf("X=%d,Y=%d,board=%c\n",x,y,board[x][y]);
        if(board[x][y]!='.') {
            dfs(x,y+1,board);
            return ;
        }
        for(int i=1;i<=9;++i) {
            if(row[x][i]==1 || col[y][i]==1 || vis[x/3][y/3][i]==1)
                continue;
            board[x][y]='0'+i;
            //printf("x=%d,y=%d,i=%d\n",x,y,i);
            row[x][i]=1;
            col[y][i]=1;
            vis[x/3][y/3][i]=1;
            dfs(x,y+1,board);
            if(flag)
                return ;
            row[x][i]=0;
            col[y][i]=0;
            vis[x/3][y/3][i]=0;
            board[x][y]='.';
        }
    }

public:
    void solveSudoku(vector<vector<char> >& board) {
        memset(col,0,sizeof(col));
        memset(row,0,sizeof(row));
        memset(vis,0,sizeof(vis));
        flag=0;

        for(int i=0;i<9;++i) {
            for(int j=0;j<9;++j) {
                if(board[i][j]=='.') continue;
                int num=board[i][j]-'0';
                row[i][num]=1;
                col[j][num]=1;
                vis[i/3][j/3][num]=1;
            }
        }

        dfs(0,0,board);
        //printf("flag=%d\n",flag);
    }
};