解数独 java leetcdoe

最新推荐文章于 2026-06-23 22:46:37 发布

原创最新推荐文章于 2026-06-23 22:46:37 发布 · 283 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#算法 #leetcode #bfs

本文介绍了如何使用Python编写一个程序，利用广度优先搜索和回溯算法解决数独问题。通过递归遍历并检查每一步的合法性，最终找到数独的唯一解。适合初学者了解算法和编程应用。

编写一个程序，通过填充空格来解决数独问题。

数独的解法需遵循如下规则：

数字 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"]]
输出：[["5","3","4","6","7","8","9","1","2"],["6","7","2","1","9","5","3","4","8"],["1","9","8","3","4","2","5","6","7"],["8","5","9","7","6","1","4","2","3"],["4","2","6","8","5","3","7","9","1"],["7","1","3","9","2","4","8","5","6"],["9","6","1","5","3","7","2","8","4"],["2","8","7","4","1","9","6","3","5"],["3","4","5","2","8","6","1","7","9"]]
解释：输入的数独如上图所示，唯一有效的解决方案如下所示：

创作不易，点个赞再走吧！

import java.util.ArrayList;
class Solution {
    private ArrayList<int[]> spaces = new ArrayList<>();
    private int[][] line = new int[9][9];
    private int[][] column = new int[9][9];
    private int[][][] block = new int[3][3][9];
    private boolean status = false;

    /**
     * @ author li 2022-01-07
     * 广度有限遍历 + 回溯算法
     * @param board 数独游戏，有唯一解
     */
    public void solveSudoku(char[][] board) {
        int tmp;
        for (int i = 0 ; i <  9 ; i++){
            for (int j = 0 ; j < 9 ; j++){
                if (board[i][j] == '.') spaces.add(new int[]{i , j});
                else {
                    tmp = board[i][j] - '0' - 1;
                    line[i][tmp] = column[j][tmp] = block[i/3][j/3][tmp] = 1;
                }
            }
        }
        dfs(board ,0);
    }

    private void dfs(char[][] board , int pos){
        if (pos == spaces.size()){
            status = true;
            return;
        }
        int[] space = spaces.get(pos);
        int i = space[0];
        int j = space[1];
        for (int digt = 0 ; digt < 9 && !status ; digt++ ){
            if (line[i][digt]==0 && column[j][digt]==0 && block[i/3][j/3][digt]==0){
                line[i][digt] = column[j][digt] = block[i/3][j/3][digt] = 1;
                board[i][j] = (char) (digt+'0'+1);
                dfs(board , pos+1);
                line[i][digt] = column[j][digt] = block[i/3][j/3][digt] = 0;
            }
        }
    }
}