LeetCode37. Sudoku Solver(解数独)

37. Sudoku Solver

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

A sudoku solution must satisfy all of the following rules:

1. Each of the digits 1-9 must occur exactly once in each row.
2. Each of the digits 1-9 must occur exactly once in each column.
3. Each of the the digits 1-9 must occur exactly once in each of the 9 3x3sub-boxes of the grid.

Empty cells are indicated by the character '.'.

A sudoku puzzle…

…and its solution numbers marked in red.

Note:

• The given board contain only digits 1-9 and the character '.'.
• You may assume that the given Sudoku puzzle will have a single unique solution.
• The given board size is always 9x9.

---

题目: 求解数独。假设每个数独有解且唯一。

思路: 对数独中的每个空的cell，遍历所有的取值，共九个值1~9。按顺序判断该数值是否满足数独的三个规则，如果满足，递归进入下一个空cell。如果在该空cell下的1~9均不满足数独的规则，说明上一个空的cell取值有问题，回溯返回。参见分析。

工程代码下载

#include<iostream>
#include<vector>
using namespace std;

class Solution {
public:
    void solveSudoku(vector<vector<char>>& board) {
       solve(board);
    }

private:
    bool solve(vector<vector<char>>& board){
        int r = board.size();
        int c= board[0].size();

        //每次都从board[0][0]开始，因为下一个空cell的位置不定
        for(int i=0; i<r; i++){
            for(int j=0; j<c; j++){
                if(board[i][j] == '.'){
                    //每个空cell可能取值1~9
                    for(char digit = '1'; digit <= '9'; digit++){
                        //判断digit放在这个空的cell里是否满足数独的规则
                        if(checkValid(board, i, j, digit)){
                            board[i][j] = digit;
                            //递归进入下一个空cell
                            if(solve(board))
                                return true;
                        }
                    }
                    //如果该空cell里九个值都不满足数独的规则，说明上一个空cell取值有问题
                    //回溯返回，状态要还原
                    board[i][j] = '.';
                    return false;
                }
            }
        }
        //没有空cell了。
        return true;
    }

    bool checkValid(vector<vector<char>>& board, int i, int j, char c)
    {
        for(int index = 0; index<9; index++){
            if(board[i][index] == c) return false;
            if(board[index][j] == c) return false;
            if(board[(i/3)*3 + index/3][(j/3)*3 + index%3] == c) return false;
        }
        return true;
    }
};

int main(int argc, char const *argv[])
{
    Solution sln;
    vector<vector<char>> testcase{
        {{'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'}}
    };
    sln.solveSudoku(testcase);
    for(auto vec: testcase){
        for(auto c: vec)
            cout<< c << ",";
        cout << endl;
    }
    return 0;
}

输出

wxl@Dell-PC:~/usr/Research/C++/leetcode/build$ ./leetcode37
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,