LeetCode刷题流程：回溯算法-15.37. 解数独

37. 解数独
编写一个程序，通过填充空格来解决数独问题。

数独的解法需 遵循如下规则：

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

示例：

输入：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] 是一位数字或者 ‘.’
题目数据 保证输入数独仅有一个解

---

class Solution {
private:
    //1、返回值与参数
    bool backtracking(vector<vector<char>>&board)
    {
        for (int i = 0; i < 9; ++i)
        {
            for (int j = 0; j < 9; ++j)
            {
                //3、单层处理逻辑
                if (board[i][j] != '.')continue;//2;goto 3
                for (int k = 1; k <= 9; ++k)
                {
                    if (isValid(i, j, board, k))
                    {
                        board[i][j] = k + '0';//1;goto 2
                        if (backtracking(board))return true;//4;goto next line
                        board[i][j] = '.';
                    }
                }
                return false;
            }
        }
        //2、终止条件
        return true;//3;goto 4//即，当所有行列都已经填满数值，那么就goto 4，直接跳出迭代，虽然可能还存在其他结果，只取第一个
    }
    bool isValid(int row, int col, vector<vector<char>>& board, int num)
    {
        //同行检测
        for (int j = 0; j < 9; ++j)
        {
            if (board[row][j] == num + '0')
                return false;
        }
        //同列检测
        for (int i = 0; i < 9; ++i)
        {
            if (board[i][col] == num + '0')
                return false;
        }
        //同格检测
        int startrow = (row / 3) * 3;//取整，(row/3)得到大格行数
        int startcol = (col / 3) * 3;//取整，(col/3)得到大格列数
        for (int i = startrow; i < startrow + 3; ++i)
        {
            for (int j = startcol; j < startcol + 3; ++j)
            {
                if (board[i][j] == num + '0')
                    return false;
            }
        }
        return true;
    }
public:
    void solveSudoku(vector<vector<char>>& board) {
        backtracking(board);
    }
};

关键部分：

//1、返回值与参数
bool backtracking(vector<vector<char>>&board)
{
    for (int i = 0; i < 9; ++i)
    {
        for (int j = 0; j < 9; ++j)
        {
            //3、单层处理逻辑
            if (board[i][j] != '.')continue;//2;goto 3
            for (int k = 1; k <= 9; ++k)
            {
                if (isValid(i, j, board, k))
                {
                    board[i][j] = k + '0';//1;goto 2
                    if (backtracking(board))return true;//4;goto next line
                    board[i][j] = '.';
                }
            }
            return false;
        }
    }
    //2、终止条件
    return true;//3;goto 4//即，当所有行列都已经填满数值，那么就goto 4，直接跳出迭代，虽然可能还存在其他结果，只取第一个
}

小小修改：如果输出结果不止一个，那么应该如何修改？

#include<vector>
#include<iostream>
using namespace std;
class Solution {
private:
    //1、返回值与参数
    bool backtracking(vector<vector<char>>&board, vector<vector<vector<char>>>&result)
    {
        for (int i = 0; i < 9; ++i)
        {
            for (int j = 0; j < 9; ++j)
            {
                //3、单层处理逻辑
                if (board[i][j] != '.')continue;
                for (int k = 1; k <= 9; ++k)
                {
                    if (isValid(i, j, board, k))
                    {
                        board[i][j] = k + '0';
                        //2、终止条件
                        if (backtracking(board, result))
                        {
                            result.emplace_back(board);
                        }
                        board[i][j] = '.';
                    }
                }
                return false;
            }
        }
        return true;
    }
    bool isValid(int row, int col, vector<vector<char>>& board, int num)
    {
        //同行检测
        for (int j = 0; j < 9; ++j)
        {
            if (board[row][j] == num + '0')
                return false;
        }
        //同列检测
        for (int i = 0; i < 9; ++i)
        {
            if (board[i][col] == num + '0')
                return false;
        }
        //同格检测
        int startrow = (row / 3) * 3;//取整，(row/3)得到大格行数
        int startcol = (col / 3) * 3;//取整，(col/3)得到大格列数
        for (int i = startrow; i < startrow + 3; ++i)
        {
            for (int j = startcol; j < startcol + 3; ++j)
            {
                if (board[i][j] == num + '0')
                    return false;
            }
        }
        return true;
    }
public:
    void solveSudoku(vector<vector<char>>& board, vector<vector<vector<char>>>&result) {
        backtracking(board,result);
    }
};
int main()
{
    Solution kill;
    vector<vector<char>>board{ {'5','.','.','.','.','.','.','.','.'},{'6','.','.','1','9','5','.','.','.'},{'.','.','8','.','.','.','.','6','.'},{'8','.','.','.','6','.','.','.','3'},{'4','.','.','8','.','3','.','.','1'},{'7','.','.','.','2','.','.','.','6'},{'.','6','.','.','.','.','2','8','.'},{'.','.','.','4','1','.','.','.','5'},{'.','.','.','.','8','.','.','7','9'} };
    for (auto bo : board)
    {
        for (char b : bo)
        {
            cout << b << " ";
        }
        cout << endl;
    }
    cout << endl;
    vector<vector<vector<char>>>result;
    kill.solveSudoku(board, result);
    for (auto res : result)
    {
        for (auto re : res)
        {
            for (char r : re)
            {
                cout << r << " ";
            }
            cout << endl;
        }
        cout << endl;
    }
    return 0;
}

5 . . . . . . . .
6 . . 1 9 5 . . .
. . 8 . . . . 6 .
8 . . . 6 . . . 3
4 . . 8 . 3 . . 1
7 . . . 2 . . . 6
. 6 . . . . 2 8 .
. . . 4 1 . . . 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

5 4 3 6 7 8 9 1 2
6 7 2 1 9 5 3 4 8
9 1 8 3 4 2 5 6 7
8 2 5 7 6 1 4 9 3
4 9 6 8 5 3 7 2 1
7 3 1 9 2 4 8 5 6
1 6 7 5 3 9 2 8 4
2 8 9 4 1 7 6 3 5
3 5 4 2 8 6 1 7 9

5 4 3 6 7 8 9 1 2
6 7 2 1 9 5 3 4 8
9 1 8 3 4 2 5 6 7
8 2 5 7 6 1 4 9 3
4 9 6 8 5 3 7 2 1
7 3 1 9 2 4 8 5 6
1 6 9 5 3 7 2 8 4
2 8 7 4 1 9 6 3 5
3 5 4 2 8 6 1 7 9

5 4 3 6 7 8 9 1 2
6 7 2 1 9 5 3 4 8
9 1 8 3 4 2 5 6 7
8 9 5 7 6 1 4 2 3
4 2 6 8 5 3 7 9 1
7 3 1 9 2 4 8 5 6
1 6 7 5 3 9 2 8 4
2 8 9 4 1 7 6 3 5
3 5 4 2 8 6 1 7 9

5 4 3 6 7 8 9 1 2
6 7 2 1 9 5 3 4 8
9 1 8 3 4 2 5 6 7
8 9 5 7 6 1 4 2 3
4 2 6 8 5 3 7 9 1
7 3 1 9 2 4 8 5 6
1 6 9 5 3 7 2 8 4
2 8 7 4 1 9 6 3 5
3 5 4 2 8 6 1 7 9