-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolver.cpp
79 lines (70 loc) · 1.3 KB
/
solver.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include "solver.h"
Data::Data()
{
}
Data::~Data()
{
}
Solver::Solver(/*int** tmp*/)
{
// for(int i = 0; i < 9; i++)
// {
// for(int j = 0; j < 9; j++)
// {
// data.data[i][j] = tmp[i][j];
// }
// }
}
Data Solver::solve()
{
DFS(sum_solve);
sum_solve = 0;
return data;
}
bool Solver::jud_row_col(int x, int y, int index)
{
for(int i = 0; i < 9; i++)
{
if(data.data[x][i] == index || data.data[i][y] == index)
return false;
}
return true;
}
bool Solver::jud_grid(int x, int y, int index)
{
for(int i = 0; i < 9; i++)
{
for(int j = 0; j < 9; j++)
{
if(x/3 == i/3 && y/3 == j/3)
{
if(data.data[i][j] == index)
return false;
}
}
}
return true;
}
bool Solver::DFS(int tmp)
{
if(tmp > 80)
return true;
int x = tmp/9;
int y = tmp%9;
if(data.data[x][y] == 0)
{
for(int i = 1; i < 10; i++)
{
if(jud_row_col(x, y, i) && jud_grid(x, y, i))
{
data.data[x][y] = i;
if(DFS(tmp + 1))
return true;
data.data[x][y] = 0;
}
}
}
else
return DFS(tmp + 1);
return false;
}