数独
9行9列的格子,完成数独
例如:
输入
0 0 5 3 0 0 0 0 0
8 0 0 0 0 0 0 2 0
0 7 0 0 1 0 5 0 0
4 0 0 0 0 5 3 0 0
0 1 0 0 7 0 0 0 6
0 0 3 2 0 0 0 8 0
0 6 0 5 0 0 0 0 9
0 0 4 0 0 0 0 3 0
0 0 0 0 0 9 7 0 0
输出
1 4 5 3 2 7 6 9 8
8 3 9 6 5 4 1 2 7
6 7 2 9 1 8 5 4 3
4 9 6 1 8 5 3 7 2
2 1 8 4 7 3 9 5 6
7 5 3 2 9 6 4 8 1
3 6 7 5 4 2 8 1 9
9 8 4 7 6 1 2 3 5
5 2 1 8 3 9 7 6 4
思路
每行每列每个块中必须含有1-9 的数字 ,不能重复
我们决定采用dfs深度优先遍历的算法,对每一个情况进行讨论
#include<iostream>
using namespace std;
int b[9][9];
bool IsPlaced(int count)
{
/*得到当前的坐标值*/
int row = count / 9;
int col = count % 9;
int j = 0;
/*行检测*/
for (j = 0; j < 9; j++)
{
if (b[row][col] == b[row][j] && j != col)
return false;
}
/*列检测*/
for (j = 0; j < 9; j++)
{
if (b[j][col] == b[row][col] && j != row)
return false;
}
/*模块检测*/
int tempRow = row/ 3 * 3;
int tempCol = col/ 3 * 3;
for (j= tempRow; j< tempRow + 3; ++j)
{
for (int k = tempCol; k < tempCol + 3; ++k) {
if (b[j][k] == b[row][col] && j != row &&k!= col) {
return false;
}
}
}
return true;
}
void backtrace(int count)//回溯
{
if (count == 81)
{
cout << "结果" << endl;
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
{
cout << b[i][j] << " ";
}
cout << endl;
}
return;
}//输出数据
/*得到坐标*/
int row = count / 9;
int col = count % 9;
if (b[row][col] == 0)
{
for (int i = 1; i <= 9; i++)
{
b[row][col] = i;//填充数字
if (IsPlaced(count))
backtrace(count + 1);
}
b[row][col] = 0;
}
else
{
backtrace(count + 1);
}
}
int main()
{
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
cin >> b[i][j];
}
backtrace(0);
return 0;
}