使用JavaScript怎么判斷有效的數(shù)獨(dú)算法?相信很多沒(méi)有經(jīng)驗(yàn)的人對(duì)此束手無(wú)策,為此本文總結(jié)了問(wèn)題出現(xiàn)的原因和解決方法,通過(guò)這篇文章希望你能解決這個(gè)問(wèn)題。
判斷一個(gè) 9x9 的數(shù)獨(dú)是否有效。只需要根據(jù)以下規(guī)則,驗(yàn)證已經(jīng)填入的數(shù)字是否有效即可。
1.數(shù)字 1-9 在每一行只能出現(xiàn)一次。
2.數(shù)字 1-9 在每一列只能出現(xiàn)一次。
3.數(shù)字 1-9 在每一個(gè)以粗實(shí)線分隔的 3x3 宮內(nèi)只能出現(xiàn)一次。
數(shù)獨(dú)部分空格內(nèi)已填入了數(shù)字,空白格用 ‘.' 表示。
示例 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
解釋: 除了第一行的第一個(gè)數(shù)字從 5 改為 8 以外,空格內(nèi)其他數(shù)字均與 示例1 相同。
但由于位于左上角的 3x3 宮內(nèi)有兩個(gè) 8 存在, 因此這個(gè)數(shù)獨(dú)是無(wú)效的。
說(shuō)明:
1.一個(gè)有效的數(shù)獨(dú)(部分已被填充)不一定是可解的。
2.只需要根據(jù)以上規(guī)則,驗(yàn)證已經(jīng)填入的數(shù)字是否有效即可。
3.給定數(shù)獨(dú)序列只包含數(shù)字 1-9 和字符 ‘.' 。
4.給定數(shù)獨(dú)永遠(yuǎn)是 9x9 形式的。
<script> var isValidSudoku = function(board) { const boxes = [{}, {}, {}, {}, {}, {}, {}, {}, {}]; const cols = [{}, {}, {}, {}, {}, {}, {}, {}, {}]; const rows = [{}, {}, {}, {}, {}, {}, {}, {}, {}]; let test = [{}, {}, {}, {}, {}, {}, {}, {}, {}]; for (let i = 0; i < 9; i++) { for (let j = 0; j < 9; j++) { const digit = board[i][j]; if (digit !== '.') { const k = Math.floor(j / 3) + (Math.floor(i / 3) * 3); if (boxes[k][digit] || cols[j][digit] || rows[i][digit]) { return false; } boxes[k][digit] = cols[j][digit] = rows[i][digit] = true; } } } return true; }; const 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"] ] console.log(isValidSudoku(board)) </script>
使用在線HTML/CSS/JavaScript代碼運(yùn)行工具:http://tools.jb51.net/code/HtmlJsRun測(cè)試上述代碼,可得如下運(yùn)行結(jié)果:
看完上述內(nèi)容,你們掌握使用JavaScript怎么判斷有效的數(shù)獨(dú)算法的方法了嗎?如果還想學(xué)到更多技能或想了解更多相關(guān)內(nèi)容,歡迎關(guān)注創(chuàng)新互聯(lián)行業(yè)資訊頻道,感謝各位的閱讀!
本文名稱:使用JavaScript怎么判斷有效的數(shù)獨(dú)算法-創(chuàng)新互聯(lián)
網(wǎng)頁(yè)URL:http://chinadenli.net/article30/dechso.html
成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián),為您提供網(wǎng)站收錄、網(wǎng)站營(yíng)銷、標(biāo)簽優(yōu)化、網(wǎng)站設(shè)計(jì)、網(wǎng)站制作、網(wǎng)站維護(hù)
聲明:本網(wǎng)站發(fā)布的內(nèi)容(圖片、視頻和文字)以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主,如果涉及侵權(quán)請(qǐng)盡快告知,我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如需處理請(qǐng)聯(lián)系客服。電話:028-86922220;郵箱:631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載,或轉(zhuǎn)載時(shí)需注明來(lái)源: 創(chuàng)新互聯(lián)
猜你還喜歡下面的內(nèi)容