leetcode Valid Sudoku(*)
来源:互联网 发布:奖励旅游 知乎 编辑:程序博客网 时间:2024/04/29 07:12
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.
判断数独是否合法,不用验证数独是否可解。依次判断数独的三个条件:横、竖、3X3格子中的9个数字是否重复即可。
class Solution {public: int cood[9][2]={{0,0},{0,3},{0,6},{3,0},{3,3},{3,6},{6,0},{6,3},{6,6}}; bool isValidSudoku(vector<vector<char> > &board) { int flag[9]; char temp; for(int i=0;i<9;i++){ memset(flag,0,sizeof(flag)); for(int j=0;j<9;j++){ temp=board[i][j]; if(temp>='1'&&temp<='9'){ flag[temp-'1']++; if(flag[temp-'1']>1)return false; } } memset(flag,0,sizeof(flag)); for(int j=0;j<9;j++){ temp=board[j][i]; if(temp>='1'&&temp<='9'){ flag[temp-'1']++; if(flag[temp-'1']>1)return false; } } } for(int i=0;i<9;i++){ memset(flag,0,sizeof(flag)); for(int m=0;m<3;m++){ for(int n=0;n<3;n++){ char temp=board[cood[i][0]+m][cood[i][1]+n]; if(temp>='1'&&temp<='9'){ flag[temp-'1']++; if(flag[temp-'1']>1)return false; } } } } 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)
- tdthfthfthfthththftfhthftfhhtf
- jdk与jre的区别
- 奋斗粉色粉色粉色粉色粉色粉色分
- 泛娱乐娱乐
- (经典)SQL语句优化
- leetcode Valid Sudoku(*)
- uva 1103 - Ancient Messages(象!形!文!字! dfs遍历计数)
- Java 之 -------------- 内部类 详解
- qsort函数、sort函数 (精心整理篇)
- 2827. Cow Solitaire 简单dp
- 【安卓笔记】仿乐安全首页动态效果
- ....
- 数据结构之线性表的顺序存储结构
- 如果多个日日都给人的个股日的如果的