Java实现解数独的小程序

1 1 2
1 4 8 
1 5 5
1 6 1
1 7 7
1 8 3
2 1 1
2 2 6
2 4 4
3 5 9
3 7 8
3 8 4
4 7 9
5 8 7
6 1 3
6 6 8
6 7 4
6 8 6
7 3 7
7 6 4
7 7 1
8 3 3
8 6 7
9 3 4
9 4 6
9 7 3
9 8 2

javac Sudoku.java 
java Sudoku 

import java.lang.System.*; 
import java.util.ArrayList; 
import java.util.Scanner; 
 
 
/**This class named Sudoku can auto calculate Sudoku but 
*you should input some nums which are already known. 
*For instance: 
*1 5 3 
*2 4 7 
*There two rows means [1][5]=3 [2][4]=7 
*i.e. In row 1 col 5 is value:5 
*you can write all known num into one txt file 
*and input into this program . 
*such as java Sudoku [][] availableNum=new ArrayList[10][10]; 
 private int[][] correctNum=new int[10][10]; 
 private Scanner scan=new Scanner(System.in); 
 private int countNum=0; 
  
 
 { 
  for(int i=0;i<10;i++){ 
   for(int j=0;j<10;j++){ 
    availableNum[i][j]=new ArrayList<>(); 
   } 
  } 
 
  for(int row=1;row<10;row++){ 
   for(int col=1;col<10;col++){ 
    for(int i=1;i<10;i++) 
     availableNum[row][col].add(new Integer(i)); 
   } 
  } 
 
  //先都初始化为-1，即此时没有填充数字 
  for(int i=0;i<10;i++) 
   for(int j=0;j<10;j++) 
    correctNum[i][j]=-1; 
 
 
 } 
 
 public Sudoku(){} 
 
 //在对应数独位置插入正确值 
 public void insert(int row,int col,int value){ 
  correctNum[row][col]=value; 
  availableNum[row][col]=null; 
  delete(row,col,value); 
 
 } 
 //每插入一个数值，就删除相应的行列和小框框3X3数独里对应的ArrayList里可能的该值 
 public void delete(int row,int col,int value){ 
  //delte row 
  for(int i=1;i<10;i++){ 
   if (availableNum[row][i]!=null) 
    availableNum[row][i].remove(new Integer(value)); 
  } 
 
  //delete column 
  for(int i=1;i<10;i++){ 
   if (availableNum[i][col]!=null) 
    availableNum[i][col].remove(new Integer(value)); 
  } 
 
  //delete box num 
  int[] itsCenter=judgeCenterPos(row,col); 
  for(int temp1=itsCenter[0]-1;temp1<=itsCenter[0]+1;temp1++) 
   for(int temp2=itsCenter[1]-1;temp2<=itsCenter[1]+1;temp2++) 
    if(availableNum[temp1][temp2]!=null){ 
     availableNum[temp1][temp2].remove(new Integer(value)); 
    } 
 
 } 
 //判断插入的值时处于哪个小框框数独里 
 public int[] judgeCenterPos(int row,int col){ 
  int[] itsCenter=new int[2]; 
  for(int centerRow=2;centerRow<9;centerRow+=3) 
   for(int centerCol=2;centerCol<9;centerCol+=3){ 
    if( Math.abs(row-centerRow)<=1 && 
     Math.abs(col-centerCol)<=1 ){ 
     itsCenter[0]=centerRow; 
     itsCenter[1]=centerCol; 
     return itsCenter; 
    } 
 
   } 
  System.out.println("Some unchecked error was happened"); 
  return itsCenter; 
 
 } 
 
 //判断空格里所能填的数字是不是只能有一个,当返回-1时通过检测报错 
 public int[] judgeIfOnlyOne(){ 
 
  for(int row=1;row<10;row++) 
   for(int col=1;col<10;col++){ 
    if(availableNum[row][col]!=null) 
     if(availableNum[row][col].size()==1) 
      return new int[]{row,col}; 
   } 
 
  return new int[]{-1,-1}; 
 
 } 
 
 // 判断为唯一，但是空格里还有多于1个的数时，我们直接将哪个正确的值填入 
 public void insertIfCan(){ 
 
  for(int row=1;row<=7;row+=3){ 
   for(int col=1;col<=7;col+=3){ 
    for(int z=1;z<10;z++){ 
     int count=0; 
     Integer temp=new Integer(z); 
     int itemp=0,jtemp=0; 
     outer: 
     for(int i=row;i1) 
          break outer; 
        } 
       } 
      } 
     } 
     if(count==1 && itemp!=0){ 
      insert(itemp,jtemp,z); 
     } 
    } 
     
   } 
  } 
 } 
 
 
 
 
 
 
 //判断数独的矩阵是否填满，没有则继续 
 public boolean judgeMatrixFull(){ 
  for(int i=1;i<10;i++) 
   for(int j=1;j<10;j++) 
    if(correctNum[i][j]==-1) 
     return false; 
  return true; 
 } 
 
 //先输入已知位置的数字 
 public void inputNumKnown(){ 
  while(scan.hasNextInt()){ 
   int row=scan.nextInt(); 
   int col=scan.nextInt(); 
   int value=scan.nextInt(); 
   insert(row,col,value); 
   delete(row,col,value); 
  } 
 } 
 
  
 
 //打印数独结果 
 public void printSudoku(){ 
  printSudoku(correctNum); 
   
 } 
 
 public void printSudoku(int[][] arr){ 
  System.out.println("Sudoku result:"); 
  for(int i=1;i<10;i++){ 
   for(int j=1;j<10;j++) 
    System.out.print(arr[i][j]+" "); 
   System.out.println(" "); 
  } 
 } 
 
 public void printList(){ 
  for(int i=1;i<10;i++) 
   for(int j=1;j<10;j++){ 
    System.out.print(i+" "+j+":"); 
    if(availableNum[i][j]!=null) 
     for(int z=0;z