Valid Sudoku
2014-03-26 19:58
211 查看
class Solution { public: bool isValidSudoku(vector<vector<char> > &board) { for(int i=0;i<9;i++) for(int j=0;j<9;j++) { if(board[i][j]!='.') if(!isvalid(board,i,j)) return false; } return true; } bool isvalid(vector<vector<char>>&board,int x,int y) { for(int i=0;i<9;i++) if(board[i][y]==board[x][y]&&i!=x) return false; for(int j=0;j<9;j++) if(board[x][j]==board[x][y]&&j!=y) return false; int a=x/3*3; int b=y/3*3; for(int i=0;i<3;i++) for(int j=0;j<3;j++) if(a+i!=x&&b+j!=y&&board[a+i][b+j]==board[x][y]) return false; return true; } };
相关文章推荐
- [LeetCode] Valid Sudoku 解题报告
- LeetCode:Valid Sudoku
- Valid Sudoku
- Valid Sudoku
- [Leetcode] Valid Sudoku
- LeetCode:Valid Sudoku,Sudoku Solver(数独游戏)
- leetcode Valid Sudoku(*)
- Valid Sudoku
- Valid Sudoku (Java)
- [C++]LeetCode: 28 Valid Sudoku
- [LeetCode]36 Valid Sudoku
- Valid Sudoku
- Valid Sudoku
- [LeetCode] Valid Sudoku 验证数独
- LeetCode 36 Valid Sudoku
- Valid Sudoku
- Valid Sudoku
- Valid Sudoku
- leetcode笔记:Valid Sudoku
- [LeetCode]题解(python):036-Valid Sudoku