java基于swing实现的连连看代码

 更新时间:2014年11月11日 15:30:30   投稿:shichen2014  
这篇文章主要介绍了java基于swing实现的连连看代码,包含了游戏中涉及的事件处理与逻辑功能,需要的朋友可以参考下

本文实例讲述了java基于swing实现连连看代码。分享给大家供大家参考。

主要功能代码如下:

复制代码 代码如下:

package llkan;

import javax.swing.*;
import java.awt.*;
import java.awt.event.*;
/**
 * 连连看游戏
 * @author Administrator
 *2014年10月17日
 */
public class MainGame implements ActionListener {
        JFrame mainFrame; // 主面板
        Container thisContainer;
        JPanel centerPanel, southPanel, northPanel; // 子面板
        JButton diamondsButton[][] = new JButton[6][5];// 游戏按钮数组
        JButton exitButton, resetButton, newlyButton; // 退出,重列,重新开始按钮
        JLabel fractionLable = new JLabel("0"); // 分数标签
        JButton firstButton, secondButton; // 分别记录两次被选中的按钮
        int grid[][] = new int[8][7];// 储存游戏按钮位置
        static boolean pressInformation = false; // 判断是否有按钮被选中
        int x0 = 0, y0 = 0, x = 0, y = 0, fristMsg = 0, secondMsg = 0, validateLV; // 游戏按钮的位置坐标
        int i, j, k, n;// 消除方法控制

        public void init() {
                mainFrame = new JFrame("连连看游戏");
                thisContainer = mainFrame.getContentPane();
                thisContainer.setLayout(new BorderLayout());
                centerPanel = new JPanel();
                southPanel = new JPanel();
                northPanel = new JPanel();
                thisContainer.add(centerPanel, "Center");
                thisContainer.add(southPanel, "South");
                thisContainer.add(northPanel, "North");
                centerPanel.setLayout(new GridLayout(6, 5));
                for (int cols = 0; cols < 6; cols++) {
                        for (int rows = 0; rows < 5; rows++) {
                                diamondsButton[cols][rows] = new JButton(
                                                String.valueOf(grid[cols + 1][rows + 1]));
                                diamondsButton[cols][rows].addActionListener(this);
                                centerPanel.add(diamondsButton[cols][rows]);
                        }
                }
                exitButton = new JButton("退出");
                exitButton.addActionListener(this);
                resetButton = new JButton("重列");
                resetButton.addActionListener(this);
                newlyButton = new JButton("再来一局");
                newlyButton.addActionListener(this);
                southPanel.add(exitButton);
                southPanel.add(resetButton);
                southPanel.add(newlyButton);
                fractionLable.setText(String.valueOf(Integer.parseInt(fractionLable
                                .getText())));
                northPanel.add(fractionLable);
                mainFrame.setBounds(280, 100, 500, 450);
                mainFrame.setVisible(true);
        }

        public void randomBuild() {
                int randoms, cols, rows;
                for (int twins = 1; twins <= 15; twins++) {
                        randoms = (int) (Math.random() * 25 + 1);
                        for (int alike = 1; alike <= 2; alike++) {
                                cols = (int) (Math.random() * 6 + 1);
                                rows = (int) (Math.random() * 5 + 1);
                                while (grid[cols][rows] != 0) {
                                        cols = (int) (Math.random() * 6 + 1);
                                        rows = (int) (Math.random() * 5 + 1);
                                }
                                this.grid[cols][rows] = randoms;
                        }
                }
        }

        public void fraction() {
                fractionLable.setText(String.valueOf(Integer.parseInt(fractionLable
                                .getText()) + 100));
        }

        public void reload() {
                int save[] = new int[30];
                int n = 0, cols, rows;
                int grid[][] = new int[8][7];
                for (int i = 0; i <= 6; i++) {
                        for (int j = 0; j <= 5; j++) {
                                if (this.grid[i][j] != 0) {
                                        save[n] = this.grid[i][j];
                                        n++;
                                }
                        }
                }
                n = n - 1;
                this.grid = grid;
                while (n >= 0) {
                        cols = (int) (Math.random() * 6 + 1);
                        rows = (int) (Math.random() * 5 + 1);
                        while (grid[cols][rows] != 0) {
                                cols = (int) (Math.random() * 6 + 1);
                                rows = (int) (Math.random() * 5 + 1);
                        }
                        this.grid[cols][rows] = save[n];
                        n--;
                }
                mainFrame.setVisible(false);
                pressInformation = false; // 这里一定要将按钮点击信息归为初始
                init();
                for (int i = 0; i < 6; i++) {
                        for (int j = 0; j < 5; j++) {
                                if (grid[i + 1][j + 1] == 0)
                                        diamondsButton[i][j].setVisible(false);
                        }
                }
        }

        public void estimateEven(int placeX, int placeY, JButton bz) {
                if (pressInformation == false) {
                        x = placeX;
                        y = placeY;
                        secondMsg = grid[x][y];
                        secondButton = bz;
                        pressInformation = true;
                } else {
                        x0 = x;
                        y0 = y;
                        fristMsg = secondMsg;
                        firstButton = secondButton;
                        x = placeX;
                        y = placeY;
                        secondMsg = grid[x][y];
                        secondButton = bz;
                        if (fristMsg == secondMsg && secondButton != firstButton) {
                                xiao();
                        }
                }
        }

        public void xiao() { // 相同的情况下能不能消去。仔细分析,不一条条注释
                if ((x0 == x && (y0 == y + 1 || y0 == y - 1))
                                || ((x0 == x + 1 || x0 == x - 1) && (y0 == y))) { // 判断是否相邻
                        remove();
                } else {
                        for (j = 0; j < 7; j++) {
                                if (grid[x0][j] == 0) { // 判断第一个按钮同行哪个按钮为空
                                        if (y > j) { // 如果第二个按钮的Y坐标大于空按钮的Y坐标说明第一按钮在第二按钮左边
                                                for (i = y - 1; i >= j; i--) { // 判断第二按钮左侧直到第一按钮中间有没有按钮
                                                        if (grid[x][i] != 0) {
                                                                k = 0;
                                                                break;
                                                        } else {
                                                                k = 1;
                                                        } // K=1说明通过了第一次验证
                                                }
                                                if (k == 1) {
                                                        linePassOne();
                                                }
                                        }
                                        if (y < j) { // 如果第二个按钮的Y坐标小于空按钮的Y坐标说明第一按钮在第二按钮右边
                                                for (i = y + 1; i <= j; i++) { // 判断第二按钮左侧直到第一按钮中间有没有按钮
                                                        if (grid[x][i] != 0) {
                                                                k = 0;
                                                                break;
                                                        } else {
                                                                k = 1;
                                                        }
                                                }
                                                if (k == 1) {
                                                        linePassOne();
                                                }
                                        }
                                        if (y == j) {
                                                linePassOne();
                                        }
                                }
                                if (k == 2) {
                                        if (x0 == x) {
                                                remove();
                                        }
                                        if (x0 < x) {
                                                for (n = x0; n <= x - 1; n++) {
                                                        if (grid[n][j] != 0) {
                                                                k = 0;
                                                                break;
                                                        }
                                                        if (grid[n][j] == 0 && n == x - 1) {
                                                                remove();
                                                        }
                                                }
                                        }
                                        if (x0 > x) {
                                                for (n = x0; n >= x + 1; n--) {
                                                        if (grid[n][j] != 0) {
                                                                k = 0;
                                                                break;
                                                        }
                                                        if (grid[n][j] == 0 && n == x + 1) {
                                                                remove();
                                                        }
                                                }
                                        }
                                }
                        }
                        for (i = 0; i < 8; i++) { // 列
                                if (grid[i][y0] == 0) {
                                        if (x > i) {
                                                for (j = x - 1; j >= i; j--) {
                                                        if (grid[j][y] != 0) {
                                                                k = 0;
                                                                break;
                                                        } else {
                                                                k = 1;
                                                        }
                                                }
                                                if (k == 1) {
                                                        rowPassOne();
                                                }
                                        }
                                        if (x < i) {
                                                for (j = x + 1; j <= i; j++) {
                                                        if (grid[j][y] != 0) {
                                                                k = 0;
                                                                break;
                                                        } else {
                                                                k = 1;
                                                        }
                                                }
                                                if (k == 1) {
                                                        rowPassOne();
                                                }
                                        }
                                        if (x == i) {
                                                rowPassOne();
                                        }
                                }
                                if (k == 2) {
                                        if (y0 == y) {
                                                remove();
                                        }
                                        if (y0 < y) {
                                                for (n = y0; n <= y - 1; n++) {
                                                        if (grid[i][n] != 0) {
                                                                k = 0;
                                                                break;
                                                        }
                                                        if (grid[i][n] == 0 && n == y - 1) {
                                                                remove();
                                                        }
                                                }
                                        }
                                        if (y0 > y) {
                                                for (n = y0; n >= y + 1; n--) {
                                                        if (grid[i][n] != 0) {
                                                                k = 0;
                                                                break;
                                                        }
                                                        if (grid[i][n] == 0 && n == y + 1) {
                                                                remove();
                                                        }
                                                }
                                        }
                                }
                        }
                }
        }

        public void linePassOne() {
                if (y0 > j) { // 第一按钮同行空按钮在左边
                        for (i = y0 - 1; i >= j; i--) { // 判断第一按钮同左侧空按钮之间有没按钮
                                if (grid[x0][i] != 0) {
                                        k = 0;
                                        break;
                                } else {
                                        k = 2;
                                } // K=2说明通过了第二次验证
                        }
                }
                if (y0 < j) { // 第一按钮同行空按钮在与第二按钮之间
                        for (i = y0 + 1; i <= j; i++) {
                                if (grid[x0][i] != 0) {
                                        k = 0;
                                        break;
                                } else {
                                        k = 2;
                                }
                        }
                }
        }

        public void rowPassOne() {
                if (x0 > i) {
                        for (j = x0 - 1; j >= i; j--) {
                                if (grid[j][y0] != 0) {
                                        k = 0;
                                        break;
                                } else {
                                        k = 2;
                                }
                        }
                }
                if (x0 < i) {
                        for (j = x0 + 1; j <= i; j++) {
                                if (grid[j][y0] != 0) {
                                        k = 0;
                                        break;
                                } else {
                                        k = 2;
                                }
                        }
                }
        }

        public void remove() {
                firstButton.setVisible(false);
                secondButton.setVisible(false);
                fraction();
                pressInformation = false;
                k = 0;
                grid[x0][y0] = 0;
                grid[x][y] = 0;
        }

        public void actionPerformed(ActionEvent e) {
                if (e.getSource() == newlyButton) {
                        int grid[][] = new int[8][7];
                        this.grid = grid;
                        randomBuild();
                        mainFrame.setVisible(false);
                        pressInformation = false;
                        init();
                }
                if (e.getSource() == exitButton)
                        System.exit(0);
                if (e.getSource() == resetButton)
                        reload();
                for (int cols = 0; cols < 6; cols++) {
                        for (int rows = 0; rows < 5; rows++) {
                                if (e.getSource() == diamondsButton[cols][rows])
                                        estimateEven(cols + 1, rows + 1, diamondsButton[cols][rows]);
                        }
                }
        }

        public static void main(String[] args) {
                MainGame mg = new MainGame();
                mg.randomBuild();
                mg.init();
        }
}

希望本文所述对大家的Java程序设计有所帮助。

相关文章

  • java枚举enum,根据value值获取key键的操作

    java枚举enum,根据value值获取key键的操作

    这篇文章主要介绍了java枚举enum,根据value值获取key键的操作,具有很好的参考价值,希望对大家有所帮助。一起跟随小编过来看看吧
    2021-02-02
  • maven中profile动态打包不同环境配置文件的实现

    maven中profile动态打包不同环境配置文件的实现

    开发项目时会遇到这个问题:开发环境,测试环境,生产环境的配置文件不同, 打包时经常要手动更改配置文件,本文就来介绍一下maven中profile动态打包不同环境配置文件的实现,感兴趣的可以了解一下
    2023-10-10
  • java中double类型运算结果异常的解决方法

    java中double类型运算结果异常的解决方法

    下面小编就为大家带来一篇java中double类型运算结果异常的解决方法。小编觉得挺不错的,现在就分享给大家,也给大家做个参考。一起跟随小编过来看看吧
    2016-12-12
  • SpringBoot基础教程之集成邮件服务

    SpringBoot基础教程之集成邮件服务

    这篇文章主要给大家介绍了关于SpringBoot基础教程之集成邮件服务的相关资料,文中通过示例代码介绍的非常详细,对大家的学习或者使用SpringBoot具有一定的参考学习价值,需要的朋友们下面来一起学习学习吧
    2020-07-07
  • Spring中@Repository注解的作用和用法以及和@Mapper的区别详析

    Spring中@Repository注解的作用和用法以及和@Mapper的区别详析

    这篇文章主要给大家介绍了关于Spring中@Repository注解的作用和用法以及和@Mapper的区别的相关资料,注解的作用是标识一个类为数据访问对象,并由Spring框架进行实例化和管理,需要的朋友可以参考下
    2023-09-09
  • 详解java解决XSS攻击常用方法总结

    详解java解决XSS攻击常用方法总结

    这篇文章主要介绍了详解java解决XSS攻击常用方法总结,文中通过示例代码介绍的非常详细,对大家的学习或者工作具有一定的参考学习价值,需要的朋友们下面随着小编来一起学习学习吧
    2021-04-04
  • GitLab在IDEA中回滚主分支问题

    GitLab在IDEA中回滚主分支问题

    这是工作中遇到的问题,记录下来,也方便自己后面查看操作步骤,也方便各位遇到这个问题,不至于卡太久,如有错误或未考虑完全的地方,望不吝赐教
    2023-11-11
  • 一分钟掌握Java ElasticJob分布式定时任务

    一分钟掌握Java ElasticJob分布式定时任务

    ElasticJob 是面向互联网生态和海量任务的分布式调度解决方案,本文主要通过简单的示例带大家深入了解ElasticJob分布式定时任务的相关知识,需要的可以参考一下
    2023-05-05
  • C# 数据类型转换

    C# 数据类型转换

    这篇文章主要讲解C语言中基本数据类型、字符串与其它数据类型以及常见的日期类型的转换,希望能给大家做一个参考。希望能够给你带来帮助
    2021-07-07
  • 总结Java中线程的状态及多线程的实现方式

    总结Java中线程的状态及多线程的实现方式

    Java中可以通过Thread类和Runnable接口来创建多个线程,线程拥有五种状态,下面我们就来简单总结Java中线程的状态及多线程的实现方式:
    2016-07-07

最新评论