-
Notifications
You must be signed in to change notification settings - Fork 0
/
sudokumodel.cpp
127 lines (108 loc) · 2.72 KB
/
sudokumodel.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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
#include "sudokumodel.h"
#include <iostream>
#include <vector>
#include <memory.h>
#include <algorithm>
using namespace std;
SudokuModel::retCheck SudokuModel::checkDefine(SudokuModel::undefCell& cell)
{
vector<int> p;
p.reserve(10);
int minCount = 10;
bool full = true;
for(int i = 0; i < 9; i++)
for(int j = 0; j < 9; j++){
if (sudokuMatrix_[i][j] == 0){
p.clear();
for(int n = 1; n < 10; n++){
if (checkV(n,i) &&
checkH(n,j) &&
checkB(n,i - i%3, j - j%3))
p.push_back(n);
}
if(!p.empty()){
auto sizeP = p.size();
if (sizeP == 1){
sudokuMatrix_.assignCeil(i, j, p.back());
i = 0, j = 0;
full = true;
minCount = 10;
}
else{
if (minCount > sizeP){
minCount = sizeP;
cell.setData(i,j,p);
}
full = false;
}
}
else return ErrorID;
}
}
return (full ? FullID : NotFull);
}
bool SudokuModel::checkV( int n, int row)
{
for(int i = 0; i<9; i++)
if (sudokuMatrix_[row][i] == n)
return false;
return true;
}
bool SudokuModel::checkH(int n, int col)
{
for(int i = 0; i<9; i++)
if (sudokuMatrix_[i][col] == n)
return false;
return true;
}
bool SudokuModel::checkB(int n, int rowb, int colb)
{
for(int i = rowb; i<rowb+3; i++)
for(int j = colb; j<colb+3; j++)
if (sudokuMatrix_[i][j] == n)
return false;
return true;
}
SudokuModel::SudokuModel()
{
}
bool SudokuModel::countSudoku()
{
sudokuMatrix_.raiseLevel();
undefCell cell;
retCheck ret = checkDefine(cell);
if (ret == ErrorID)
return false;
if (ret == NotFull){
for(auto x: cell.var_){
sudokuMatrix_.raiseLevel();
sudokuMatrix_.assignCeil(cell.row_, cell.col_, x);
if (countSudoku())
return true;
sudokuMatrix_.clearDataPerLevel();
}
sudokuMatrix_.reduceLevel();
return false;
}
return true;
}
void SudokuModel::assignCeil(int i, int j, int n)
{
sudokuMatrix_.assignCeil(i,j,n);
}
int SudokuModel::getData(int i, int j)
{
return sudokuMatrix_[i][j];
}
void SudokuModel::clearAll()
{
sudokuMatrix_.clearAll();
}
void SudokuModel::clearSol()
{
sudokuMatrix_.clearSol();
}
bool SudokuModel::hintSudoku()
{
return true;
}