输入描述:
输入9行,每行为空格隔开的9个数字,为0的地方就是需要填充的。
输出描述:
输出九行,每行九个空格隔开的数字,为解出的答案。
示例:
import java.util.*;
public class Main{
//分别保存行、列、9宫格中已填的数字
static boolean[][] row = new boolean[9][10];
static boolean[][] col = new boolean[9][10];
static boolean[][][] square = new boolean[3][3][10];
static List<int[]> room = new LinkedList<>();//保存需要填入的位置
static boolean isOver = false;//是否填满数组
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int[][] nums = new int[9][9];
//读取数组
for(int i = 0 ; i < 9 ; i++){
for(int j = 0 ; j < 9 ; j++){
int num = scanner.nextInt();
nums[i][j] = num;
if(num==0)room.add(new int[]{i,j});
else row[i][num] = col[j][num] = square[i/3][j/3][num] = true;
}
}
dfs(nums,0);//深度遍历填空
//输出数组
for(int i = 0 ; i < 9 ; i++){
for(int j = 0 ; j < 9 ; j++){
System.out.print(nums[i][j]+" ");
}
System.out.println();
}
}
public static void dfs(int[][] nums, int pos){
if(pos == room.size()){
isOver = true;
return;
}
int ii = room.get(pos)[0];
int jj = room.get(pos)[1];
for(int num = 1 ; num < 10 && !isOver ; num++){
//回溯填空
if(canFill(ii,jj,num)){
nums[ii][jj] = num;
row[ii][num] = col[jj][num] = square[ii/3][jj/3][num] = true;
dfs(nums,pos+1);
row[ii][num] = col[jj][num] = square[ii/3][jj/3][num] = false;
}
}
}
public static boolean canFill(int i, int j,int num){ //判断是否位置是否可以填该数
return !(row[i][num] || col[j][num] || square[i/3][j/3][num]);
}
}