LeetCode Valid Sudoku
来源:互联网 发布:sql必知必会 pdf 微盘 编辑:程序博客网 时间:2024/06/06 21:04
Q:
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.
代码:
class Solution {public: bool isValidSudoku(vector<vector<char> > &board) {int i, j;int row[9], col[9]; for(i = 0; i < 9; i++){memset(row,0,sizeof(int)*9); memset(col,0,sizeof(int)*9);for(j = 0; j < 9; j++){if(board[i][j] != '.'){if(row[board[i][j] - '1'] > 0)return false;else row[board[i][j] - '1']++;}if(board[j][i] != '.'){if(col[board[j][i] - '1'] > 0)return false;else col[board[j][i] - '1']++;}}} for(i = 0; i < 9; i += 3)for(j = 0; j < 9; j += 3){int a, b;memset(row,0,sizeof(int)*9);for(a = 0; a < 3; a++)for(b = 0; b < 3; b++){if(board[i+a][j+b] != '.'){if(row[board[i+a][j+b] - '1'] > 0)return false;else row[board[i+a][j+b] - '1']++;}}}return true; }};
还有种更简单的解法:
bool isValidSudoku(vector<vector<char> > &board) { vector<vector<bool>> rows(9, vector<bool>(9,false));vector<vector<bool>> cols(9, vector<bool>(9,false));vector<vector<bool>> blocks(9, vector<bool>(9,false));for(int i = 0; i < 9; i++)for(int j = 0; j < 9; j++){if(board[i][j] == '.')continue;int num = board[i][j] - '1';if(rows[i][num] || cols[j][num] || blocks[i - i%3 + j/3][num])return false;rows[i][num] = cols[j][num] = blocks[i - i%3 + j/3][num] = true;}return true; }
0 0
- 【LeetCode】Valid Sudoku && Sudoku Solver
- [Leetcode]Sudoku Solver&&Valid Sudoku
- leetcode Valid Sudoku & Sudoku Solver
- LeetCode : Valid Sudoku
- [LeetCode]Valid Sudoku
- [leetcode] Valid Sudoku
- LeetCode-Valid Sudoku
- LeetCode Valid Sudoku
- LeetCode - Valid Sudoku
- LeetCode:Valid Sudoku
- leetcode-036:Valid Sudoku
- Leetcode: Valid Sudoku
- LeetCode题解:Valid Sudoku
- 【LeetCode】 Valid Sudoku
- Leetcode Valid Sudoku
- LeetCode | Valid Sudoku
- LeetCode Valid Sudoku
- [Leetcode] Valid Sudoku (Java)
- git stash的用法
- 线程7种状态的相互转换
- spark学习十五 spark的容错分析
- hduoj1095(A+B for Input-Output Practice (VII))
- 2014华为机试
- LeetCode Valid Sudoku
- servlet工作原理及实例演示
- hduoj1096(A+B for Input-Output Practice (VIII))
- 去掉java反编译(JD-GUI)生成的源文件中注释
- Web开发108式
- I - The 3n + 1 problem(2.4.2)
- Linux通过该控制台的字符流 实现打印出的字符不同颜色
- Raising Modulo Numbers +快速幂取模算法
- android:clipChildren属性的分析——是否剪裁子View