摘要： 简单的DFS，预处理优化了一下。#include <algorithm>#include <iostream>#include <cstring>#include <vector>#include <string>using namespace std;const int N = 9;int table[N][N] = {};bool flag = false;class Blank{public: int row; int column; int num; bool candidate[N + 1];public: Blank(co 阅读全文