leetcode 37. 解数独-java
题目所属分类
dfs
原题链接
代码案例:输入: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”]]
解释:输入的数独如上图所示,唯一有效的解决方案如下所示:
题解
感觉这题出的没啥多大意义 就是思路是爆搜
简单的dfs
class Solution {
boolean rows[][]=new boolean[9][9];
boolean cols[][]=new boolean[9][9];
boolean boxs[][][]=new boolean[3][3][9];
public void solveSudoku(char[][] board) {
for(int i = 0 ; i < 9 ; i++){
for(int j = 0 ; j < 9 ; j++){
if(board[i][j] != '.'){
int t = board[i][j] - '1';
rows[i][t] = cols[j][t] = boxs[i/3][j/3][t] = true;
}
}
}
dfs(board,0,0);
}
public boolean dfs(char[][] board,int x , int y ){
// 竖着为x 横着为y
//判断边界
if(y == 9){
x ++;
y = 0;
if(x == 9) return true;
}
if(board[x][y] != '.') return dfs(board,x,y + 1);
for(int i = 0 ; i < 9 ; i++){
if(!rows[x][i]&& !cols[y][i] && !boxs[x/3][y/3][i]){
board[x][y] = (char)('1'+i);
rows[x][i] = cols[y][i] = boxs[x/3][y/3][i] = true;
if(dfs(board,x,y)) return true;
board[x][y] = '.';
rows[x][i] = cols[y][i] = boxs[x/3][y/3][i] = false;
}
}
return false;
}
}
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 【.NET】调用本地 Deepseek 模型
· CSnakes vs Python.NET:高效嵌入与灵活互通的跨语言方案对比
· Plotly.NET 一个为 .NET 打造的强大开源交互式图表库
· DeepSeek “源神”启动!「GitHub 热点速览」
· 上周热点回顾(2.17-2.23)