使用JavaScript怎么判断有效的数独算法?相信很多没有经验的人对此束手无策,为此本文总结了问题出现的原因和解决方法,通过这篇文章希望你能解决这个问题。
判断一个9 * 9的数独是否有效。只需要根据以下规则,验证已经填入的数字是否有效即可。
1。数字1 - 9在每一行只能出现一次。
2。数字1 - 9在每一列只能出现一次。
3。数字1 - 9在每一个以粗实线分隔的3 x3宫内只能出现一次。
数独部分空格内已填入了数字,空白格用的强生# 39;表示。
示例 1:
输入:
[
["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
示例 2:
输入:
[
["8","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"]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外,空格内其他数字均与 示例1 相同。
但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。
说明:
1.一个有效的数独(部分已被填充)不一定是可解的。
2.只需要根据以上规则,验证已经填入的数字是否有效即可。
3.给定数独序列只包含数字1 - 9和字符“强生# 39;。
4。给定数独永远是9 x9形式的。
& lt; script> var isValidSudoku =,函数(董事会),{ ,const boxes =, ({}, {},,, {}, {},,, {}, {},,, {}, {},, {}); ,const cols =, ({}, {},,, {}, {},,, {}, {},,, {}, {},, {}); ,const rows =, ({}, {},,, {}, {},,, {}, {},,, {}, {},, {}); ,let test =, ({}, {},,, {}, {},,, {}, {},,, {}, {},, {}); ,for (let 小姐:=,0;,小姐:& lt;, 9;,我+ +),{ for 才能;(let j =, 0;, j & lt;, 9。, j + +), { ,,const digit =,董事会[我][j]; ,,if (digit !==, & # 39; # 39;公司),{ ,,,const k =, Math.floor(时间/j 3), +, (Math.floor(时间/小姐;3),*,3); ,,,if (盒子[k][数字],| |,关口[j][数字],| |,行[我][数字]),{ ,,,,return 假; ,,,} ,,,盒子[k][数字],=,关口[j][数字],=,行[我][数字],=,真的; ,,} ,,} ,} ,return 真实; }; const board =, ( ,(“5”,“3”,“干净,“!”,“7“,“!”,“干净,“!”,“干净), ,(“6”,“管理者”,“管理者”,,“1”,“9”,“5“,“!”,“干净,“!”), ,(“管理者”,“9“,“8”,“干净,“!”,“干净,“!”,“6“,“!”), null null null null null null null null null使用JavaScript怎么判断有效的数独算法