详细解读Java对对碰图形版卡游戏的源代码-课程设计

import java.util.Random; import java.awt.BorderLayout; import java.awt.Dimension; import java.awt.FlowLayout; import java.awt.Graphics; import java.awt.Graphics2D; import java.awt.Cursor; import java.awt.Color; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.awt.event.MouseMotionAdapter; import java.awt.event.MouseEvent; import java.awt.event.MouseAdapter; import java.awt.image.BufferedImage; import java.awt.Rectangle; import javax.imageio.ImageIO; import javax.swing.JLabel; import javax.swing.JOptionPane; import javax.swing.JPanel; import javax.swing.JTextPane; import javax.swing.JTextArea; import javax.swing.JTextField; import javax.swing.JFrame; import javax.swing.JScrollPane; import javax.swing.Timer; import java.io.File; import java.io.IOException; class GameRoom extends JFrame { private final int ANIMAL_WIDTH = 48; //动物图片的宽度 private final int ANIMAL_HEIGHT = 48; //动物图片的高度 private final int ANIMAL_NUM = 7; //动物数量 private final int DDP_MATRIX_ROW = 8; private final int DDP_MATRIX_COL = 8; private final int EMPTY = 7; //对对碰矩阵值空时的标记 private boolean isThreeLinked; //标记是否有三个以上的连接 //标记单击次数 private boolean isDoubleClicked; private int x1; //记录第一次被点击的X坐标 private int y1; //记录第一次被点击的Y坐标 private BufferedImage roomBackground; //房间的图片背景 //随机数 private Random rand = new Random(); //动物数组 private int[][] animal = new int[DDP_MATRIX_ROW][DDP_MATRIX_COL]; private BufferedImage pool; private BufferedImage[] animalImage = new BufferedImage[ANIMAL_NUM]; private RoomPanel roomPanel = new RoomPanel();//游戏区面板 JTextField textarea1 = new JTextField(10); //显示分数 JTextField textarea2 = new JTextField(10); //显示剩余时间 private int grade = 0; //得分 private Timer timer; //定时器 //消除三个以上连接的点 private void removeLinked(int x, int y) { if(animal[x][y] == EMPTY)return; int n=0; int tmp; int linked = 1; if (x + 1 < 8) { tmp = x + 1; while (tmp < 8 && animal[x][y] == animal[tmp][y]) { linked++; tmp++; } } if (x - 1 >= 0) { tmp = x - 1; while (tmp >= 0 && animal[x][y] == animal[tmp][y]) { linked++; tmp--; } } if (linked >= 3) { n=n+linked; tmp = x + 1; while (tmp < 8 && animal[tmp][y] == animal[x][y]) { animal[tmp][y] = EMPTY; tmp++; } tmp = x - 1; while (tmp >= 0 && animal[tmp][y] == animal[x][y]) { animal[tmp][y] = EMPTY; tmp--; } // 当前交换过来的点 animal[x][y] = EMPTY; } tmp = 0; linked = 1; if (y + 1 < 8) { tmp = y + 1; while (tmp < 8 && animal[x][y] == animal[x][tmp]) { linked++; tmp++; } } if (y - 1 >= 0) { tmp = y - 1; while (tmp >= 0 && animal[x][y] == animal[x][tmp]) { linked++; tmp--; } } if (linked >= 3) { n=n+linked; tmp = y + 1; while (tmp < 8 && animal[x][y] == animal[x][tmp]) { animal[x][tmp] = EMPTY; tmp++; } tmp = y - 1; while (tmp >= 0 && animal[x][y] == animal[x][tmp]) { animal[x][tmp] = EMPTY; tmp--; } // 当前交换过来的点 animal[x][y] = EMPTY; } grade+=n*10; textarea1.setText(Integer.toString(grade)); System.out.println(grade + " ======"+x+" "+y); } /*功能:全局扫描三个相连相同的点 *@param: flag flag为1时:只判断是否有三个相连的点 * flag为2时:删除三个相连的点 */ private boolean globalSearch(int flag) {//** if (1 == flag) { for (int i = 0; i < DDP_MATRIX_ROW; i++) { for (int j = 0; j < DDP_MATRIX_COL; j++) { if (isThreeLinked(i, j)) { return true; } } } } else if (2 == flag) { for (int i = 0; i < DDP_MATRIX_ROW; i++) { for (int j = 0; j < DDP_MATRIX_COL; j++) { //删除三个相连的点 removeLinked(i, j); } } } return false; } //是否有三个以上连接的点 private boolean isThreeLinked(int x, int y) { int tmp; int linked = 1; if (x + 1 < DDP_MATRIX_ROW) { tmp = x + 1; while (tmp < DDP_MATRIX_ROW && animal[x][y] == animal[tmp][y]) { linked++; tmp++; } } if (x - 1 >= 0) { tmp = x - 1; while (tmp >= 0 && animal[x][y] == animal[tmp][y]) { linked++; tmp--; } } if (linked >= 3) { /* tmp = x + 1; while (tmp < DDP_MATRIX_ROW && animal[tmp][y] == animal[x][y]) { tmp++; } tmp = x - 1; while (tmp >= 0 && animal[tmp][y] == animal[x][y]) { tmp--; }*/ return true; } linked = 1; if (y + 1 < DDP_MATRIX_COL) { tmp = y + 1; while (tmp < DDP_MATRIX_COL && animal[x][y] == animal[x][tmp]) { linked++; tmp++; } } if (y - 1 >= 0) { tmp = y - 1; while (tmp >= 0 && animal[x][y] == animal[x][tmp]) { linked++; tmp--; } } if (linked >= 3) { /* tmp = y + 1; while (tmp < DDP_MATRIX_COL && animal[x][y] == animal[x][tmp]) { tmp++; } tmp = y - 1; while (tmp >= 0 && animal[x][y] == animal[x][tmp]) { tmp--; }*/ return true; } return false; } //更新动物矩阵 private void updateAnimal() { for (int i = 0; i < DDP_MATRIX_ROW; i++) { for (int j = 0; j < DDP_MATRIX_COL; j++) { if (animal[i][j] == EMPTY) { //将矩阵中为空值的点再进行随机赋值 animal[i][j] = rand.nextInt(ANIMAL_NUM); } } } } //动物下降 // private void downAnimal() { // int tmp; // for (int j = DDP_MATRIX_COL - 1; j >= 0; j--) { // for (int i = 0; i < DDP_MATRIX_ROW; i++) { // //第i列j行为空（被削去动物) // if (animal[j][i] == EMPTY) { // //第i列上方动物下移 // for (int k = j - 1; k >= 0; k--) { // tmp = animal[k][i]; // animal[k][i] = animal[k+1][i]; // animal[k+1][i] = tmp; // } // } // } // } // } //动物下降 private void downAnimal() { int tmp; for (int j = DDP_MATRIX_COL - 1; j >= 0; j--) { for (int i = 0; i < DDP_MATRIX_ROW; i++) { if (animal[j][i] == EMPTY) { for (int k = j - 1; k >= 0; k--) { if (animal[k][i] != EMPTY) { tmp = animal[k][i]; animal[k][i] = animal[j][i]; animal[j][i] = tmp; break; } } } } } } private void print() { for (int i = 0; i < DDP_MATRIX_ROW; i++) { for (int j = 0; j < DDP_MATRIX_COL; j++) { System.out.print(animal[i][j]);