题意
给一个9*9的数独棋盘,看目前的数字合不合法。
思路
顺序判断。
代码
class Solution {
public:
bool isValidSudoku(vector<vector<char>>& board) {
bool mp[100];
int i, j, k;
for (i = 0; i < 9; i++)
{
memset(mp, 0, sizeof mp);
for (j = 0; j < 9; j++)
{
if (mp[board[i][j]] && board[i][j] != '.') return false;
mp[board[i][j]] = true;
}
}
for (i = 0; i < 9; i++)
{
memset(mp, 0, sizeof mp);
for (j = 0; j < 9; j++)
{
if (mp[board[j][i]] && board[j][i] != '.') return false;
mp[board[j][i]] = true;
}
}
for (k = 0; k < 9; k++)
{
memset(mp, 0, sizeof mp);
for (i = k/3*3; i < k/3*3+3; i++)
{
for (j = k%3*3; j < k%3*3+3; j++)
{
if (mp[board[i][j]] && board[i][j] != '.') return false;
mp[board[i][j]] = true;
}
}
}
return true;
}
};
更好的解法
用三个容器分别代表每一行/列/块,某个数字是否出现过。一个个扫描即可。
class Solution
{
public:
bool isValidSudoku(vector<vector<char> > &board)
{
bool used1[9][9] = {0}, used2[9][9] = {0}, used3[9][9] = {0};
for(int i = 0; i < board.size(); ++ i)
for(int j = 0; j < board[i].size(); ++ j)
if(board[i][j] != '.')
{
int num = board[i][j] - '0' - 1, k = i / 3 * 3 + j / 3;
if(used1[i][num] || used2[j][num] || used3[k][num])
return false;
used1[i][num] = used2[j][num] = used3[k][num] = 1;
}
return true;
}
};
参考:
https://leetcode.com/problems/valid-sudoku/discuss/15464/My-short-solution-by-C%2B%2B.-O(n2)