有效的数独
请你判断一个 9 x 9 的数独是否有效。只需要 根据以下规则 ，验证已经填入的数字是否有效即可。
- 数字 1-9 在每一行只能出现一次。
- 数字 1-9 在每一列只能出现一次。
- 数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）
注意：
- 一个有效的数独（部分已被填充）不一定是可解的。
- 只需要根据以上规则，验证已经填入的数字是否有效即可。
- 空白格用 '.' 表示。
示例：
输入：board =
[["5","3",".",".","7",".",".",".","."]
,["6",".",".","1","9","5",".",".","."]
,[".","9","8",".",".",".",".","6","."]
,["8",".",".",".","6",".",".",".","3"]
,["4",".",".","8",".","3",".",".","1"]
,["7",".",".",".","2",".",".",".","6"]
,[".","6",".",".",".",".","2","8","."]
,[".",".",".","4","1","9",".",".","5"]
,[".",".",".",".","8",".",".","7","9"]]
输出：true
1
2
3
4
5
6
7
8
9
10
11
2
3
4
5
6
7
8
9
10
11
/**
* @param {character[][]} board
* @return {boolean}
*/
var isValidSudoku = function(board) {
let row = new Array(9)
let col = new Array(9)
let boardbox = new Array(9)
for (let i = 0; i < board.length; i++) {
for (let j = 0; j < 9; j++) {
let boardIndex = Math.floor(j/3) + (Math.floor(i/3)) * 3
if (!row[i]) row[i] = []
if (!col[j]) col[j] = []
if (!boardbox[boardIndex]) boardbox[boardIndex] = []
if (row[i].indexOf(board[i][j]) > -1) return false
if (col[j].indexOf(board[i][j]) > -1) return false
if (boardbox[boardIndex].indexOf(board[i][j]) > -1) return false
if (!(isNaN(board[i][j] - 0))) {
row[i].push(board[i][j])
col[j].push(board[i][j])
boardbox[boardIndex].push(board[i][j])
}
}
}
return true
};
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
来源：力扣（LeetCode） 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。