# 36. Valid Sudoku

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.

1.我的答案

class Solution {
public:
bool check(vector<bool>& v, int num){
if(v[num])
return true;
v[num] = true;
return false;
}

bool isValidSudoku(vector<vector<char>>& board) {
//开3个辟辅助空间
vector<bool> rownum(10,false);
vector<vector<bool>> colnum(9, vector<bool>(10,false));
vector<vector<bool>> cellnum(9, vector<bool>(10,false));
for(int i = 0; i < 9; i++){
vector<bool>rownum(9,false);
for(int j = 0; j < 9; j++){
if(board[i][j] == '.')
continue;
bool b1 = check(rownum, board[i][j]-'0');
bool b2 = check(colnum[j], board[i][j]-'0');
bool b3 = check(cellnum[(i/3)*3+j/3], board[i][j]-'0');
if(b1 || b2 || b3)
return false;
}
}
return true;
}
};

2.别人的答案 用位

bool isValidSudoku(vector<vector<char>>& board) {
vector<short> col(9, 0);
vector<short> block(9, 0);
vector<short> row(9, 0);
for (int i = 0; i < 9; i++)
for (int j = 0; j < 9; j++) {
if (board[i][j] != '.') {
int idx = 1 << (board[i][j] - '0');
if (row[i] & idx || col[j] & idx || block[i/3 * 3 + j / 3] & idx)
return false;
row[i] |= idx;
col[j] |= idx;
block[i/3 * 3 + j/3] |= idx;
}
}
return true;
}

#### LeetCode（36）Valid Sudoku

2015-08-25 20:40:50

#### 36. Valid Sudoku [easy] (Python)

2016-06-06 16:35:20

#### LeetCode 36 Valid Sudoku (C,C++,Java,Python)

2015-05-18 22:56:46

#### leetcode 36: Valid Sudoku

2015-01-29 12:59:05

#### LeetCode-36. Valid Sudoku (JAVA)（有效数独）

2017-04-17 09:25:04

#### LeetCode 36 Valid Sudoku（有效数独）

2015-11-30 20:58:35

#### LeetCode---Valid Sudoku解题分析

2016-05-30 21:40:08

#### 36. Valid Sudoku LeetCode

2016-02-11 23:34:04

#### Leetcode 36. Valid Sudoku

2016-01-25 05:51:01

#### LeetCode *** 36. Valid Sudoku

2016-04-09 20:36:39