forked from AnksBackup/DSA-for-beginners
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsudoku_solver.cpp
46 lines (45 loc) · 1.19 KB
/
sudoku_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
// Leetcode 37. Sudoku Solver (https://leetcode.com/problems/sudoku-solver/)
class Solution {
public:
void solveSudoku(vector<vector<char>>& a) {
solvesudoku(a);
}
private:
bool solvesudoku(vector<vector<char>>& a)
{
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
if(a[i][j]=='.')
{
for(char c='1';c<='9';c++)
{
if(solve(i,j,c,a))
{
a[i][j] = c;
if(solvesudoku(a))
{
return true;
}
a[i][j] = '.';
}
}
return false;
}
}
}
return true;
}
private:
bool solve(int row,int col,char c,vector<vector<char>>& a)
{
for(int i=0;i<9;i++)
{
if(a[i][col]==c) return false;
if(a[row][i]==c) return false;
if(a[3*(row/3) + (i/3)][3*(col/3) + (i%3)]==c) return false;
}
return true;
}
};