-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetcode第37题.cpp
More file actions
56 lines (56 loc) · 1.39 KB
/
Leetcode第37题.cpp
File metadata and controls
56 lines (56 loc) · 1.39 KB
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
class Solution {
bool IsValid(vector<vector<char>>& board,int row,int col,char num)
{
for(int i=0;i<9;++i)
{
if(board[i][col]==num){
return false;
}
}
for(int i=0;i<9;++i)
{
if(board[row][i]==num){
return false;
}
}
int start_x=(row/3)*3,start_y=(col/3)*3;
for(int i=0;i<3;++i)
{
for(int j=0;j<3;++j)
{
if(board[start_x+i][start_y+j]==num)
{
return false;
}
}
}
return true;
}
bool BackTracking(vector<vector<char>>& board)
{
for(int i=0;i<9;++i)
{
for(int j=0;j<9;++j)
{
if(board[i][j]=='.'){
for(char k='1';k<='9';++k)
{
if(IsValid(board,i,j,k)){
board[i][j]=k;
if(BackTracking(board)){
return true;
}
board[i][j]='.';
}
}
return false;
}
}
}
return true;
}
public:
void solveSudoku(vector<vector<char>>& board) {
BackTracking(board);
}
};