-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path36-Valid-Sudoku.cpp
More file actions
82 lines (68 loc) · 1.86 KB
/
36-Valid-Sudoku.cpp
File metadata and controls
82 lines (68 loc) · 1.86 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
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
class Solution {
public:
bool validRows(vector<vector<char>>& board)
{
for( int i = 0; i < board.size(); i++ )
{
map<char,int>vis;
for( int j = 0; j < board[i].size(); j++ )
vis[board[i][j]]++;
for( int j = '1'; j <= '9'; j++ )
if( vis[j] > 1 )
return false;
}
return true;
}
bool validCols(vector<vector<char>>& board)
{
for( int j = 0; j < board[0].size(); j++ )
{
map<char,int>vis;
for( int i = 0; i < board.size(); i++ )
vis[board[i][j]]++;
for( int i = '1'; i <= '9'; i++ )
if( vis[i] > 1 )
return false;
}
return true;
}
bool validSubs(vector<vector<char>>& board)
{
int l = 0, r = 0, begl = 0;
map<char, int>vis;
while( true )
{
int begr = r;
while( r < begr + 3 )
vis[board[l][r++]]++;
l++;
r = begr;
if( l == begl + 3 )
{
l = begl, r = begr + 3;
for( int i = '1'; i <= '9'; i++ )
if( vis[i] > 1 )
return false;
for( int i = '1'; i <= '9'; i++ )
vis[i] = 0;
}
if( r >= board[0].size() )
{
l = begl + 3, r = 0;
begl += 3;
}
if( l >= board.size() )
break;
}
return true;
}
bool isValidSudoku(vector<vector<char>>& board)
{
bool row = validRows(board);
bool column = validCols(board);
bool subs = validSubs(board);
if( row && column && subs )
return true;
return false;
}
};