有效的数独(数组leetcode36)-------------------c实现
题目表述
请你判断一个 9 x 9 的数独是否有效。只需要 根据以下规则 ,验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。(请参考示例图)
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/valid-sudoku
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
样例
输入:board =
[[“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
条件
board.length == 9
board[i].length == 9
board[i][j] 是一位数字(1-9)或者 ‘.’
思路
先判断每个3*3小方格,然后判断每一行每一列
注意点
注意先处理字符到数字的转换,可以节省时间
ac代码
class Solution {
public:
bool isValidSudoku(vector<vector<char>>& board) {
int visit[10];
int r,l,member;
for(int i=0;i<3;i++)
for(int j=0;j<3;j++){
memset(visit,0,sizeof(visit));
r=i*3;
l=j*3;
for(int x=r;x<r+3;x++)
for(int y=l;y<l+3;y++){
member=board[x][y]-'1';
if(member>=0&&member<=9)
{
if(visit[member])
return false;
else
visit[member]++;
}
}
}
//判断每一个3*3方块
for(int i=0;i<9;i++)
{
memset(visit,0,sizeof(visit));
for(int j=0;j<9;j++)
{
member=board[i][j]-'1';
if(member>=0&&member<=9)
{
if(visit[member])
return false;
else
visit[member]++;
}
}//判断每一行
memset(visit,0,sizeof(visit));
for(int z=0;z<9;z++)
{
member=board[z][i]-'1';
if(member>=0&&member<=9)
{
if(visit[member])
return false;
else
visit[member]++;
}
}//判断每一列
}
return true;
}
};
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/squares-of-a-sorted-array
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。