分享程序员开发的那些事...
更新时间：2022-10-03 13:48:15
36. Valid Sudoku(合法数独)
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.
The Sudoku board could be partially filled, where empty cells are filled with the character '.'.
A partially filled sudoku which is valid.
Note:
A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be validated.
关于数独的简介：
1.Each row must have the numbers 1-9 occuring just once.
2.Each column must have the numbers 1-9 occuring just once.
3.And the numbers 1-9 must occur just once in each of the 9 sub-boxes of the grid.
题目大意：
判断一个给定的二维数组是否是一个合法的数独矩阵。
思路:
采用set这一容器，来进行去重。
1.判断每一行是否合法。
2.判断每一列是否合法。
3.判断每一个九宫格是否合法。
代码如下：
|
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
|
class Solution {
public:
bool isValidSudoku(vector<vector<char>>& board)
{
set<char> mySet;
//1.判断每一行是否合法
for (int row = 0; row < 9; row++)
{
//cout<<"检测行:"<<row<<endl;
for (int column = 0; column < 9; column++)
{
if (board[row][column] == '.')
{
continue;
}
if (mySet.find(board[row][column]) == mySet.end())
{
mySet.insert(board[row][column]);
}
else
{
return false;
}
}
mySet.clear();
}
//2.判断每一列是否合法
for (int row = 0; row < 9; row++)
{
//cout<<"检测列:"<<row<<endl;
for (int column = 0; column < 9; column++)
{
if (board[column][row] == '.')
{
continue;
}
if (mySet.find(board[column][row]) == mySet.end())
{
mySet.insert(board[column][row]);
}
else
{
return false;
}
}
mySet.clear();
}
//3.判断每一个九宫格是否合法
for (int row = 0; row < 9; row += 3)
{
for (int column = 0; column < 9; column += 3)
{
for (int i = row; i < row + 3; i++)
{
for (int j = column; j < column + 3; j++)
{
if (board[i][j] == '.')
{
continue;
}
if (mySet.find(board[i][j]) == mySet.end())
{
mySet.insert(board[i][j]);
}
else
{
return false;
}
}
}
mySet.clear();
}
}
return true;
}
}; |