【leetcode】37.Sudoku Solver（解数独）

【leetcode】37.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:

Each of the digits 1-9 must occur exactly once in each row.
Each of the digits 1-9 must occur exactly once in each column.
Each of the the digits 1-9 must occur exactly once in each of the 9 3x3 sub-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.

---

37.解数独

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

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

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。
空白格用 '.' 表示。

一个数独。

答案被标成红色。

Note:

给定的数独序列只包含数字 1-9 和字符 '.' 。
你可以假设给定的数独只有唯一解。
给定数独永远是 9x9 形式的。

---

思路：

暴力搜索

1. 这题没什么好说的，深搜可解。
2. 鉴于只需要一种解即可，没必要上广搜（可能还会引起爆内存）

CODE：

class Solution {
public:
    void solveSudoku(vector<vector<char>>& board) {
        vector<pair<int, int>> v;
        for (int y = 0; y < 9; ++y)
            for (int x = 0; x < 9; ++x)
                if (board[y][x] == '.')
                    v.push_back(make_pair(y, x));

        stack<char> s;
        char val_start = '1', val;
        for (int i = 0; i < v.size(); ) {
            pair<int, int>& p = v[i];
            for (val = val_start; val <= '9'; ++val) {
                if (checkValid(board, val, p.first, p.second)) {
                    break;
                }
            }
            if (val <= '9') {
                val_start = '1';
                s.push(val);
                board[p.first][p.second] = val;
                ++i;
            } else {
                val_start = s.top() + 1;
                s.pop();
                board[v[s.size()].first][v[s.size()].second] = '.';
                --i;
            }
        }
    }

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