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

原创于 2020-04-10 18:03:26 发布 · 412 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#dfs #c++ #数独

本文介绍了一种使用深度优先搜索(DFS)和回溯法解决数独问题的算法。通过检查每一行、每一列和每一个小九宫格是否违反数独规则，确保每个单元格的数字都是有效的。此算法能够有效地解决任意难度级别的数独谜题。

bool check(int &n, char ch, vector<vector<char>> &board) {
	int row = n / 9;
	int col = n % 9;
	for (int i = 0; i < 9; i++) {
		if (board[row][i] == ch || board[i][col] == ch)
			return false;
	}

	int rowApp = row / 3;
	int colApp = col / 3;
	for (int i = 0; i < 3; i++)
		for (int j = 0; j < 3; j++) {
			int rowNew = i + rowApp * 3;
			int colNew = j + colApp * 3;
			if (board[rowNew][colNew] == ch && !(rowNew == row && colNew == col)) {
				return false;
			}
		}
	return true;
}

bool DFS(vector<vector<char>>& board, int n) {
	if (n == 81) {
		return true;
	}
	int row = n / 9;
	int col = n % 9;
	if (board[row][col] != '.') {
		return DFS(board, n + 1);
	}
	else
		for (int k = 1; k < 10; k++) {
			if (check(n, k + '0', board)) {
				board[row][col] = k + '0';
				if (DFS(board, n + 1))
					return true;
				board[row][col] = '.';
			}
		}
	return false;
}

void solveSudoku(vector<vector<char>>& board) {
	DFS(board, 0);
}