Valid Sudoku 数独的有效性
来源:互联网 发布:c语言乘法口诀 编辑:程序博客网 时间:2024/04/27 06:02
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) { //判断每一行 for(int i=0;i<9;i++){ vector<int> num(9,0); for(int j=0;j<9;j++){ if(board[i][j] != '.'){ num[board[i][j]-'1']++; if(num[board[i][j]-'1']>1){ return false; } } } } //判断每一列 for(int i=0;i<9;i++){ vector<int> num(9,0); for(int j=0;j<9;j++){ if(board[j][i] != '.'){ num[board[j][i]-'1']++; if(num[board[j][i]-'1']>1){ return false; } } } } //判断每个小宫 for(int i=0;i<3;i++){ for(int j=0;j<3;j++){ vector<int> num(9,0); for(int h=0;h<3;h++){ for(int k=0;k<3;k++){ if(board[3*i+h][3*j+k] != '.'){ num[board[3*i+h][3*j+k]-'1']++; if(num[board[3*i+h][3*j+k]-'1']>1){ return false; } } } } } } return true; }};
0 0
- Valid Sudoku 数独的有效性
- Valid Sudoku 数独的有效性
- LeetCode Valid Sudoku数独有效性验证
- Valid Sudoku 有效的数独
- 数独判断 Valid Sudoku
- Valid Sudoku-数独判断
- 有效数独 Valid Sudoku
- Valid Sudoku:数独验证
- Valid Sudoku 判断数独的合法性 3个判断
- Leetcode 36 Valid Sudoku 数独的合法性判断
- [LeetCode] [数独问题] Valid Sudoku
- LintCode Valid Sudoku 判断数独是否合法
- (LeetCode)Valid Sudoku --- 合法数独
- 36. Valid Sudoku (判断数独)
- leetcode(36) - Valid Sudoku 数独
- leetcode 36. Valid Sudoku 数独有效
- LeetCode:Valid Sudoku,Sudoku Solver(数独游戏)
- leetcode 37. Sudoku Solver 36. Valid Sudoku 数独问题
- 排序算法之Bogo排序
- Linux网络配置
- hibernate.hbm2ddl.auto参数说明
- 怎么把项目发布到微信公众平台上面
- test
- Valid Sudoku 数独的有效性
- Sublime2配置less2css插件教程
- 【收藏帖】windows和Linux的数据类型对比
- ArtTemplate使用笔记
- linux下搭建生成HLS所需的.ts和.m3u8文件
- weka数据导入
- LeetCode Binary Search Tree Iterator
- spring4+springmvc+springdataJPA+hibernate4 整合懒加载问题
- 高性能Mysql主从架构的复制原理及配置详解