LeetCoder_____ 解数独(37)

1. 思路

深搜dfs，通过vis1, vis2, vis3 分别记录行、列、3x3宫格出线的数字。

2.代码

class Solution {
public:
    void solveSudoku(vector<vector<char>>& board) {
        bool vis1[10][10] = {0}, vis2[10][10] = {0}, vis3[10][10] = {0};
        for(int i = 0; i < board.size(); ++i)
        {
            for(int j = 0; j < board[i].size(); ++j)
            {
                if(board[i][j] != '.')
                {
                    vis1[i][board[i][j] - '0'] = true;
                    vis2[j][board[i][j] - '0'] = true;
                    vis3[i / 3 * 3 + j / 3][board[i][j] - '0'] = true;
                }
            }
        }
        dfs(board, 0, 0, vis1, vis2, vis3);
    }


    bool dfs(vector<vector<char>>& board, int x, int y, bool vis1[10][10], bool vis2[10][10], bool vis3[10][10])
    {
        if(x == 9)
        {
            return true;
        }

        if(board[x][y] != '.')
        {
            return dfs(board, x + (y + 1) / 9, (y + 1) % 9, vis1, vis2, vis3);
        }

        for(int i = 1; i <= 9; ++i)
        {
            if(vis1[x][i])continue;
            if(vis2[y][i])continue;
            if(vis3[x / 3 * 3 + y / 3][i])continue;

            board[x][y] = i + '0';
            vis1[x][i] = true;
            vis2[y][i] = true;
            vis3[x / 3 * 3 + y / 3][i] = true;
            if(dfs(board, x + (y + 1) / 9, (y + 1) % 9, vis1, vis2, vis3)) return true;
            board[x][y] = '.';
            vis1[x][i] = false;
            vis2[y][i] = false;
            vis3[x / 3 * 3 + y / 3][i] = false;
        }
        return false;
    }


};