编写一个程序,通过填充空格来解决数独问题。
数独的解法需 遵循如下规则:
数字 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] 是一位数字或者 '.'
题目数据 保证 输入数独仅有一个解
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/sudoku-solver
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
class Solution {
struct strSudoku {
int row;
int column;
char data;
};
public:
void solveSudoku(vector<vector<char>>& board) {
bool rowSudokuDataFlag[9][9] = { {0} };
bool columnSudokuDataFlag[9][9] = { {0} };
bool submoduleSudokuDataFlag[9][9] = { {0} };
int i = 0, j = 0;
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
if (board[i][j] != '.')
{
rowSudokuDataFlag[i][board[i][j] - '1'] = true;
columnSudokuDataFlag[j][board[i][j] - '1'] = true;
submoduleSudokuDataFlag[(i / 3) * 3 + j / 3][board[i][j] - '1'] = true;
}
}
}
vector<strSudoku> sudokuData;
int dataSize = 0;
bool resetFlag = false;
for (i = 0, j = 0; i < 9;)
{
cout << "i = " << i << " j = " << j << endl;
for (; j < 9; j++)
{
if (board[i][j] == '.')
{
bool findItem = false;
char item = '1';
dataSize = sudokuData.size();
if (resetFlag)
{
item = sudokuData[dataSize - 1].data;
rowSudokuDataFlag[i][item - '1'] = false;
columnSudokuDataFlag[j][item - '1'] = false;
submoduleSudokuDataFlag[(i / 3) * 3 + j / 3][item - '1'] = false;
sudokuData.erase(sudokuData.begin() + dataSize - 1);
item++;
resetFlag = false;
}
for (; item <= '9'; item++)
{
if (!rowSudokuDataFlag[i][item - '1'] && !columnSudokuDataFlag[j][item - '1'] && !submoduleSudokuDataFlag[(i / 3) * 3 + j / 3][item - '1'])
{
findItem = true;
rowSudokuDataFlag[i][item - '1'] = true;
columnSudokuDataFlag[j][item - '1'] = true;
submoduleSudokuDataFlag[(i / 3) * 3 + j / 3][item - '1'] = true;
board[i][j] = item;
sudokuData.push_back({ i, j, item });
cout << "Insert i = " << i << " j = " << j << " item = " << item << endl;
break;
}
}
cout << "Run in line 68. findItem = " << findItem << endl;
if (!findItem)
{
dataSize = sudokuData.size();
i = sudokuData[dataSize - 1].row;
j = sudokuData[dataSize - 1].column;
board[i][j] = '.';
resetFlag = true;
break;
}
}
}
if (resetFlag)
{
continue;
}
else
{
i++;
j = 0;
}
}
}
};
int main()
{
Solution obj;
vector<vector<char>> 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'},
};
obj.solveSudoku(board);
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
{
cout << board[i][j] << " ";
}
cout << endl;
}
return 0;
}