😁

public class Solution { public void solveSudoku(char[][] board) { dfs(board,0,0); } boolean dfs(char[][] board,int x,int y){ if(x==9)return true; if(y==9)return dfs(board,x+1,0); if(board[x][y] != '.')return dfs(board,x,y+1); for(char c='1';c<='9';++c){ if(!isValid(board,x,y,c))continue; board[x]...