36. Valid Sudoku

最新推荐文章于 2018-08-17 20:52:56 发布

原创最新推荐文章于 2018-08-17 20:52:56 发布 · 397 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一个用于验证数独是否有效的算法实现。该算法检查数独盘面的每一行、每一列以及每一个小九宫格内数字是否重复，确保符合数独游戏的基本规则。即使数独未被完全填满也能进行有效性的验证。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

36. Valid Sudoku

My Submissions

Total Accepted: 73627 Total Submissions: 239374 Difficulty: Easy

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.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

Have you met this question in a real interview?

Yes

Discuss Notes

class Solution {
public:
  bool isValidSudoku(vector<vector<char>>& board) {
       int h[9][9]={},w[9][9]={};
       int b[9][9]={};
       for(int i=0;i<9;i++)
          for(int j=0;j<9;j++)
          {
              if(board[i][j]=='.') continue;
              int t=board[i][j]-'1';
              if(h[i][t]++ | w[j][t]++ | b[i/3*3+j/3][t]++ ) return false;
          }
         return true;
  }
};