数独游戏界面功能

根据题目要求，本次采用JAVA添加GUI界面，并根据上次老师点评的要求下对原数独实现进行一定改进，因此，JAVA源码如下：

1、GUI界面设计如下

package JAVA练习;
import javax.swing.*;    
import java.awt.*;
import java.awt.event.*;
import java.util.Random;
 
public class ShuDu extends JFrame{
    private static final long serialVersionUID = 5952689219411916553L;    //序列化字段
    private static JTextField a[][] = new JTextField[9][9];        //存储文本框中的数字
    static int ans[][] = new int[9][9];        //存储输入后的两位数组
    SudoGenerator example = new SudoGenerator();
    public int right[][] = example.generatePuzzleMatrix();
    public int rightans[][];
    private int[][] Wk(int a[][]){                //挖空
        Random r = new Random();
        int a1, a2;
        a1 = r.nextInt(9);
        a2 = r.nextInt(9);
        for(int i = 0; i < 100; i++)
        {
            a[a1][a2] = 0;
            a1 = r.nextInt(9);
            a2 = r.nextInt(9);
        }
        return a;
    }
    public ShuDu(){
        Container c = getContentPane();
        c.setLayout(new BorderLayout(2, 1));        //边框布局
        JMenuItem jmiOk = new JMenuItem("提交");        //定义菜单
        JMenuItem jmiExplain = new JMenuItem("详情");
        JMenuItem jmiMessage = new JMenuItem("信息");
        
        JPanel panel = new JPanel();        //定义一个容器
        panel.add(jmiOk);                    //将菜单在容器内显示
        panel.add(jmiExplain);
        panel.add(jmiMessage);
        JPanel p1 = new JPanel(new GridLayout(9, 9, 5, 5));        //定义9行9列的网格布局
        add(panel,BorderLayout.NORTH);            //将菜单放置在北面
        add(p1,BorderLayout.CENTER);            //将数字放置在正中间
        rightans = Wk(right);
        for(int k = 0;k<9; k ++)
        {
            for(int n=0;n<9;n++)
            {
                if(rightans[k][n] != 0)
                {
                    a[k][n] = new JTextField("" + rightans[k][n]);
                    a[k][n].setHorizontalAlignment(JTextField.CENTER);//将数字水平居中
                    a[k][n].setEditable(false);            //只可显示不可修改
                    p1.add(a[k][n]);                    //添加文本框
                }
                else
                {
                    a[k][n] = new JTextField();        
                    a[k][n].setHorizontalAlignment(JTextField.CENTER);
                    p1.add(a[k][n]);
                }
            }
        }
        add(p1);            //将数字面板显示在容器里
        jmiOk.addActionListener(new ActionListener(){//匿名创建事件监听器
            public void actionPerformed(ActionEvent e)
            {
                if(gettext() == 1)
                {
                    if(judge() == true)
                    {
                        JOptionPane.showMessageDialog(null, "Your answer is right!","Result",JOptionPane.INFORMATION_MESSAGE);
                    }
                    else
                    {
                        JOptionPane.showMessageDialog(null, "Your answer is wrong!","Result",JOptionPane.INFORMATION_MESSAGE);
                    }
                }
            }
        });    
        explainListenerClass listener2 = new explainListenerClass();
        jmiExplain.addActionListener(listener2);
        messageListenerClass listener3 = new messageListenerClass();
        jmiMessage.addActionListener(listener3);
    }
    
    static int gettext()            //获取文本框的文字
    {
        int i,j;
        for(i = 0; i < 9; i++)
        {
            for(j = 0; j < 9 ; j ++)
            {
                ans[i][j] = 0;
            }
        }
        for(int k = 0;k < 9; k++)
        {
            for(int n = 0;n < 9; n++)
            {
                try            //异常处理
                {
                    ans[k][n] = Integer.parseInt(a[k][n].getText());        //将答案类型转换之后传给ans
                }
                catch(NumberFormatException nfe)
                {
                    JOptionPane.showMessageDialog(null,"数据中包括非数字，请重新输入");
                    return 0;
                }
            }
        }
        return 1;
    }
    public static boolean judge()            //判断输入的答案是否正确
    {
        int i,j,k;
        int [][]answer = ans;            
        
        for(i = 0; i < 9; i ++)
        {
            if(judge9(answer[i]) == false)        //判断每列是否有重复数字
                return false;
        }
        for(j = 0; j < 9; j ++)                    //判断每行是否有重复数字
        {
            
            int[] newAnswerColumn = new int[9];
            for(i = 0; i < 9; i ++)
            {
                newAnswerColumn[i] = answer[i][j];
            }
            if(judge9(newAnswerColumn) == false)
                return false;
        }
        for(i = 0; i < 3; i ++)            //判断每个小九宫格内是否有重复数字
        {
            for(j = 0; j < 3; j ++)
            {
                k = 0;
                int[] newAnswer = new int[9];
                for(int m = i * 3; m < i * 3 + 3; m ++)
                {
                    for(int n = j * 3; n < j * 3 + 3; n ++)
                    {
                        newAnswer[k] = answer[m][n];
                        k++;
                    }
                }
                if(judge9(newAnswer) == false)
                {
                    return false;
                }        
            }
        }
        return true;
    }
    public static boolean judge9(int[] answer)
    {
        int i,j;
        for(i = 0; i < 9; i ++)
        {
            for(j = 0; j < 9; j ++)
            {
                if(i == j)
                    continue;
                if(answer[i] == answer[j])        //如果有重复的数字，返回false
                {
                    return false;
                }
            }
        }
        return true;        //没有重复数字，返回true
    }
    
    public static void main(String[] args) {
        JFrame frame = new ShuDu();
        frame.setTitle("软件工程数独求解");
        frame.setSize(600,700);
        frame.setLocationRelativeTo(null);        
        frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
        frame.setVisible(true);
    }
}
class explainListenerClass implements ActionListener{        //事件监听器
    public void actionPerformed(ActionEvent e){
        JOptionPane.showMessageDialog(null, "填入数字保证每行每列及每个小的九宫格内数字无重复","Explain",JOptionPane.INFORMATION_MESSAGE); 
    }
}
class messageListenerClass implements ActionListener{
    public void actionPerformed(ActionEvent e){
        JOptionPane.showMessageDialog(null, "made by wyx","Message",JOptionPane.INFORMATION_MESSAGE); 
    }
}

2、后端处理如下

package JAVA练习;
import java.util.Random;

public class SudoGenerator {
	private Random random = new Random();  
    
    private static final int MAX_CALL_RANDOM_ARRAY_TIMES = 220;  
   
    private int currentTimes = 0;  
  
    public int[][] generatePuzzleMatrix() {  
  
        int[][] randomMatrix = new int[9][9];  
  
        for (int row = 0; row < 9; row++) {  
            if (row == 0) {  
                currentTimes = 0;  
                randomMatrix[row] = buildRandomArray();  
  
            } else {  
                int[] tempRandomArray = buildRandomArray();  
  
                for (int col = 0; col < 9; col++) {  
                    if (currentTimes < MAX_CALL_RANDOM_ARRAY_TIMES) {  
                        if (!isCandidateNmbFound(randomMatrix, tempRandomArray, row, col)) {  
                              
                            resetValuesInRowToZero(randomMatrix,row);  
                            row -= 1;  
                            col = 8;  
                            tempRandomArray = buildRandomArray();  
                        }  
                    } else {   
                        row = -1;  
                        col = 8;  
                        resetValuesToZeros(randomMatrix);  
                        currentTimes = 0;  
                    }  
                }  
            }  
        }  
        return randomMatrix;  
    }  
      
    private void resetValuesInRowToZero(int[][] matrix, int row)  
    {  
        for (int j = 0; j < 9; j++) {  
            matrix[row][j] = 0;  
        }  
          
    }  
  
    private void resetValuesToZeros(int[][] matrix) {  
        for (int row = 0; row < 9; row++) {  
            for (int col = 0; col < 9; col++) {  
                matrix[row][col] = 0;  
            }  
        }  
    }  
  
    private boolean isCandidateNmbFound(int[][] randomMatrix,  int[] randomArray, int row, int col) {  
        for (int i = 0; i < 9; i++) {  
            randomMatrix[row][col] = randomArray[i];  
            if (noConflict(randomMatrix, row, col)) {  
                return true;  
            }  
        }  
        return false;  
    }  
  
    private boolean noConflict(int[][] candidateMatrix, int row, int col) {  
        return noConflictInRow(candidateMatrix, row, col)&&noConflictInColumn(candidateMatrix, row, col)  && noConflictInBlock(candidateMatrix, row, col);  
    }  
  
    private boolean noConflictInRow(int[][] candidateMatrix, int row, int col) {  
        
        int currentValue = candidateMatrix[row][col];  
  
        for (int colNum = 0; colNum < col; colNum++) {  
            if (currentValue == candidateMatrix[row][colNum]) {  
                return false;  
            }  
        } 
  
        return true;  
    } 
  
    private boolean noConflictInColumn(int[][] candidateMatrix, int row, int col) {  
  
        int currentValue = candidateMatrix[row][col];  
  
        for (int rowNum = 0; rowNum < row; rowNum++) {  
            if (currentValue == candidateMatrix[rowNum][col]) {  
                return false;  
            }  
        }  
  
        return true;  
    }  
  
    private boolean noConflictInBlock(int[][] candidateMatrix, int row, int col) {  
  
        int baseRow = row / 3 * 3;  
        int baseCol = col / 3 * 3;  
  
        for (int rowNum = 0; rowNum < 8; rowNum++) {  
            if (candidateMatrix[baseRow + rowNum / 3][baseCol + rowNum % 3] == 0) {  
                continue;  
            }  
            for (int colNum = rowNum + 1; colNum < 9; colNum++) {  
                if (candidateMatrix[baseRow + rowNum / 3][baseCol + rowNum % 3] == candidateMatrix[baseRow  
                        + colNum / 3][baseCol + colNum % 3]) {  
                    return false;  
                }  
            }  
        }  
        return true;  

    }   
    private int[] buildRandomArray() {  
        currentTimes++;  
        int[] array = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9 };  
        int randomInt = 0;    
        for (int i = 0; i < 20; i++) {  
            randomInt = random.nextInt(8) + 1;  
            int temp = array[0];  
            array[0] = array[randomInt];  
            array[randomInt] = temp;  
        }  
  
        return array;  
    }  
   
    public int getCurrentTimes() {  
        return currentTimes;  
    }  
   
    public void setCurrentTimes(int currentTimes) {  
        this.currentTimes = currentTimes;  
    }  
      
} 
 
 

　　3、程序界面如下

4、程序分析：本次作业基于上一次的数独作业，改正了数独生成个数0<N<1000000，并且代码已上传至conding,

https://git.coding.net/dhlg_201810812005/ShuDu.git

5、学习心得

本次处理根据上一次老师点评的要求，有了较大的改进，但还是有很多的地方不是很懂，为此，进行了较长时间的学习，特别是添加GUI设计界面，还是事件监控等，本次程序设计并不是完全由个人开发，很大程度是参考他人代码而实现