Java基于二维数组实现的数独问题示例

import java.util.Random;
import java.util.ArrayList;
public class Suduku {
  /**
   *打印二维数组，数独矩阵
   */
  public static void printArray(int a[][])
  {
    for (int i = 0; i <9; i++) {
      for (int j = 0; j <9; j++) {
        System.out.print(" "+a[i][j]);
        if (0==((j+1)%3)) {
          System.out.print(" ");
        }
      }
      System.out.println();
      if(0==((i+1)%3))
      {
        System.out.println();
      }
    }
  }
  /**
   * 产生一个1-9的不重复长度为9的一维数组
   */
  public static ArrayList creatNineRondomArray()
  {
    ArrayList list = new ArrayList();
    Random random=new Random();
    for (int i = 0; i <9; i++) {
      int randomNum=random.nextInt(9)+1;
      while (true) {
        if (!list.contains(randomNum)) {
          list.add(randomNum);
          break;
        }
        randomNum=random.nextInt(9)+1;
      }
    }
    System.out.println("生成的一位数组为：");
    for (Integer integer : list) {
      System.out.print(" "+integer.toString());
    }
    System.out.println();
    return list;
  }
  /**
   *通过一维数组和原数组生成随机的数独矩阵
   *
   *遍历二维数组里的数据，在一维数组找到当前值的位置，并把一维数组
   *当前位置加一处位置的值赋到当前二维数组中。目的就是将一维数组为
   *依据，按照随机产生的顺序，将这个9个数据进行循环交换，生成一个随
   *机的数独矩阵。
   *
   */
  public static void creatSudokuArray(int[][]seedArray,ArrayList randomList)
  {
    for (int i = 0; i <9; i++) {
      for (int j = 0; j <9; j++) {
        for (int k = 0; k <9; k++) {
          if(seedArray[i][j]==randomList.get(k))
          {
            seedArray[i][j]=randomList.get((k+1)%9);
            break;
          }
        }
      }
    }
    System.out.println("处理后的数组");
    Suduku.printArray(seedArray);
  }
  public static void creatSudokuQuestion(int [][] a)
  {
    Random rand=new Random();
    for(int i=0;i<9;i++){
      for(int j=0;j<4;j++){
      a[i][(int)rand.nextInt(9)]=0;
      }
    }
    Suduku.printArray(a);
  }
  //
  public static void main(String[] args) {
    int seedArray[][]={
        {9,7,8,3,1,2,6,4,5},
        {3,1,2,6,4,5,9,7,8},
        {6,4,5,9,7,8,3,1,2},
        {7,8,9,1,2,3,4,5,6},
        {1,2,3,4,5,6,7,8,9},
        {4,5,6,7,8,9,1,2,3},
        {8,9,7,2,3,1,5,6,4},
        {2,3,1,5,6,4,8,9,7},
        {5,6,4,8,9,7,2,3,1}
    };
    System.out.println("原始的二维数组:");
    Suduku.printArray(seedArray);
    ArrayList randomList=Suduku.creatNineRondomArray();
    Suduku.creatSudokuArray(seedArray, randomList);
    System.out.println("生成数独问题:");
    Suduku.creatSudokuQuestion(seedArray);
  }
}

原始的二维数组:
 9 7 8 3 1 2 6 4 5 
 3 1 2 6 4 5 9 7 8 
 6 4 5 9 7 8 3 1 2 

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

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

生成的一位数组为：
 2 3 9 1 6 8 7 5 4
处理后的数组
 1 5 7 9 6 3 8 2 4 
 9 6 3 8 2 4 1 5 7 
 8 2 4 1 5 7 9 6 3 

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

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

生成数独问题:
 0 5 7 9 6 3 0 0 0 
 9 6 3 0 0 0 0 5 7 
 0 2 4 1 0 7 9 6 0 

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

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