判断一个 9x9 的数独是否有效。只需要根据以下规则,验证已经填入的数字是否有效即可。
- 数字
1-9
在每一行只能出现一次。 - 数字
1-9
在每一列只能出现一次。 - 数字
1-9
在每一个以粗实线分隔的3x3
宫内只能出现一次。
上图是一个部分填充的有效的数独。
数独部分空格内已填入了数字,空白格用 '.'
表示。
示例 1:
输入: [ ["5","3",".",".","7",".",".",".","."], ["6",".",".","1","9","5",".",".","."], [".","9","8",".",".",".",".","6","."], ["8",".",".",".","6",".",".",".","3"], ["4",".",".","8",".","3",".",".","1"], ["7",".",".",".","2",".",".",".","6"], [".","6",".",".",".",".","2","8","."], [".",".",".","4","1","9",".",".","5"], [".",".",".",".","8",".",".","7","9"] ] 输出: true
示例 2:
输入: [ ["8","3",".",".","7",".",".",".","."], ["6",".",".","1","9","5",".",".","."], [".","9","8",".",".",".",".","6","."], ["8",".",".",".","6",".",".",".","3"], ["4",".",".","8",".","3",".",".","1"], ["7",".",".",".","2",".",".",".","6"], [".","6",".",".",".",".","2","8","."], [".",".",".","4","1","9",".",".","5"], [".",".",".",".","8",".",".","7","9"] ] 输出: false 解释: 除了第一行的第一个数字从 5 改为 8 以外,空格内其他数字均与 示例1 相同。 但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。
说明:
一个有效的数独(部分已被填充)不一定是可解的。
只需要根据以上规则,验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9
和字符 '.'
。
给定数独永远是 9x9
形式的。
C++
class Solution {
public:
bool isValidSudoku(vector<vector<char>>& board)
{
int n=9;
vector<int> tmp(9,0);
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(board[i][j]>='1' && board[i][j]<='9')
{
tmp[board[i][j]-'1']++;
if(tmp[board[i][j]-'1']>1)
{
return false;
}
}
}
for(int j=0;j<n;j++)
{
tmp[j]=0;
}
}
for(int j=0;j<n;j++)
{
for(int i=0;i<n;i++)
{
if(board[i][j]>='1' && board[i][j]<='9')
{
tmp[board[i][j]-'1']++;
if(tmp[board[i][j]-'1']>1)
{
return false;
}
}
}
for(int i=0;i<n;i++)
{
tmp[i]=0;
}
}
for(int i=0;i<n;i+=3)
{
for(int j=0;j<n;j+=3)
{
for(int k=i;k<i+3;k++)
{
for(int t=j;t<j+3;t++)
{
if(board[k][t]>='1' && board[k][t]<='9')
{
tmp[board[k][t]-'1']++;
if(tmp[board[k][t]-'1']>1)
{
return false;
}
}
}
}
for(int k=0;k<n;k++)
{
tmp[k]=0;
}
}
}
return true;
}
};
python
class Solution:
def isValidSudoku(self, board):
"""
:type board: List[List[str]]
:rtype: bool
"""
n=9
tmp=[0 for i in range(n)]
for i in range(n):
for j in range(n):
if board[i][j]>='1' and board[i][j]<='9':
mm=ord(board[i][j])-ord('1')
tmp[mm]+=1
if tmp[mm]>1:
return False
for j in range(n):
tmp[j]=0
for j in range(n):
for i in range(n):
if board[i][j]>='1' and board[i][j]<='9':
mm=ord(board[i][j])-ord('1')
tmp[mm]+=1
if tmp[mm]>1:
return False
for i in range(n):
tmp[i]=0
for i in range(0,9,3):
for j in range(0,9,3):
for k in range(i,i+3):
for t in range(j,j+3):
if board[k][t]>='1' and board[k][t]<='9':
mm=ord(board[k][t])-ord('1')
tmp[mm]+=1
if tmp[mm]>1:
return False
for k in range(n):
tmp[k]=0
return True