博主介绍： 🚀自媒体 JavaPub 独立维护人，全网粉丝15w+，csdn博客专家、java领域优质创作者，51ctoTOP10博主，知乎/掘金/华为云/阿里云/InfoQ等平台优质作者、专注于Java技术领域和副业。🚀
公众号：JavaPub ⭐ ⭐简历模板、学习资料、面试题库等都给你💪
🍅
文末获取源码🍅 无套路，免费领取
适合人群：Java初级学习者和爱好者，下面有展示图。
1 前言
🚀获取源码，文末公众号回复【1024】，即可。
⭐欢迎点赞留言
2 正文
公众号：JavaPub
2.1 展示
1.4MB GIF可以欣赏：https://tva2.sinaimg.cn/large/007F3CC8ly1h0r2x7v9i6g31190noe81.gif
2.2 项目结构
2.2 主要代码展示
package com.tudou;
import java.awt.event.KeyEvent;
import java.util.HashMap;
/*
* 方块
*/
public class Block {
public static HashMap<Integer, int[]> numberblocks = new HashMap<>();
static {
int[][] hexColors = {{184, 212, 235}, {158, 172, 238}, { 16, 200, 221}, { 7, 169, 239}, { 41, 124, 183},
{150, 224, 52}, { 33, 225, 59}, {203, 121, 252}, { 10, 197, 158}, { 4, 2, 89},
{ 71, 97, 245}, { 67, 17, 237}, {209, 252, 060}, {247, 211, 84}, {216, 167, 133},
{244, 128, 92}, {215, 65, 74}, {172, 70, 56}, {191, 20, 98}, {209, 14, 4}};
int[] zeroColors = {219, 219, 219};
Block.numberblocks.put(new Integer(0), zeroColors);
for(int i=1; i <= hexColors.length; i++){
Block.numberblocks.put(new Integer((int) Math.pow(2,i)), hexColors[i-1]);
}
}
public static int[] getColor(Integer number){
return Block.numberblocks.get(number);
}
public static Block random(int pos_x, int pos_y){
//int count = Block.numberblocks.size();
int count = 3;
int power = (int) (Math.random()*100%count) + 1;
int number = (int) Math.pow(2, power);
Block block = new Block(number, pos_x, pos_y);
return block;
}
public int number;
public int pos_x;//lie
public int pos_y;//hang
public Block(int number, int pos_x, int pos_y) {
// TODO Auto-generated constructor stub
this.number = number;
this.pos_x = pos_x;
this.pos_y = pos_y;
}
public void setNumber(int number){
this.number = number;
}
private void setPostion(int pos_x, int pos_y){
this.pos_x = pos_x;
this.pos_y = pos_y;
}
public void merge(){
this.number += number;
}
public void move(int direction){
switch (direction) {
case KeyEvent.VK_W:
this.setPostion(pos_x, pos_y-1);
break;
case KeyEvent.VK_S:
this.setPostion(pos_x, pos_y+1);
break;
case KeyEvent.VK_A:
this.setPostion(pos_x-1, pos_y);
break;
case KeyEvent.VK_D:
this.setPostion(pos_x+1, pos_y);
break;
default:
break;
}
}
}
2.4 按钮相关类
package com.tudou;
import java.awt.BasicStroke;
import java.awt.Color;
import java.awt.Font;
import java.awt.Graphics;
import java.awt.Graphics2D;
import java.awt.GridLayout;
import java.awt.event.KeyAdapter;
import java.awt.event.KeyEvent;
import java.awt.event.MouseAdapter;
import java.awt.event.MouseEvent;
import java.awt.event.WindowAdapter;
import java.awt.event.WindowEvent;
import javax.swing.JFrame;
import javax.swing.JMenu;
import javax.swing.JMenuBar;
import javax.swing.JMenuItem;
public class Grassdurian extends JFrame{
public int count_x; //水平方块个数
public int count_y; //垂直方块个数
public int size; //尺寸
public int distance;//间距
private Block[][] blocks; //方块
private Block activitedBlock; //活动方块
private int scope; //分数
public Grassdurian(int count_x, int count_y, int size, int distance){
init(count_x, count_y, size, distance);
}
public void init(int count_x, int count_y, int size, int distance){
this.count_x = count_x;
this.count_y = count_y;
this.size = size;
this.distance = distance;
this.scope = 0;
prepareGUI();
}
// 运行
public void run(){
//
this.scope = 0;
this.blocks = new Block[count_y][count_x];
for(int line=0; line < count_x; line++){
for(int row=0; row < count_y; row++){
this.blocks[line][row] = Block.random(row, line);
if(Math.random()*10 >= 5){
System.out.println("设置为0");
this.blocks[line][row].setNumber(0);
}
}
}
this.setActivitedBlock(blocks[count_y/2][count_x/2]);
repaint();
}
// 准备GUI
private void prepareGUI(){
this.setTitle("1024");
this.setSize((size+distance)*count_x, (size+distance)*count_y);
this.setLayout(new GridLayout(count_y, count_x));
// 窗口事件处理
this.addWindowListener(new WindowAdapter() {
public void windowClosing(WindowEvent windowEvent){
System.exit(0);
}
});
// 按键事件处理
this.addKeyListener(new KeyAdapter() {
public void keyPressed(KeyEvent e){
int keyCode = e.getKeyCode();
//空格
if(keyCode == KeyEvent.VK_SPACE){
run();
}else{
move(keyCode);
repaint();
setTitle("1024 总分数"+scope);
}
}
});
// 鼠标事件处理
this.addMouseListener(new MouseAdapter() {
@Override
public void mouseClicked(MouseEvent e) {
super.mouseClicked(e);
setActivitedBlockByPostion(e.getX(), e.getY());
}
});
this.setVisible(true);
}
@Override
public void paint(Graphics g){
drawCanvas(g);
}
// 通过位置设置活动方块
public void setActivitedBlockByPostion(int pos_x, int pos_y){
int x = pos_x/size;
int y = pos_y/size;
Block block = blocks[y][x];
setActivitedBlock(block);
repaint();
}
// 设置活动方块
public void setActivitedBlock(Block block){
this.activitedBlock = block;
}
// 绘制画布
public void drawCanvas(Graphics g)
{
// 清屏
g.setColor(new Color(255, 255, 255));
g.fillRect(0, 0, (size+distance)*count_x, (size+distance)*count_y);
for(int line=0; line < count_y; line++){
for(int row=0; row < count_x; row++){
Block block = this.blocks[line][row];
int[] colors = Block.getColor(block.number);
String number = String.valueOf(block.number);
int numberLength = number.length();
int fontSize = size/numberLength;
int x = block.pos_x*(size+distance);
int y = block.pos_y*(size+distance);
int width = size-distance;
int height = size-distance;
// 绘制矩形
g.setColor(new Color(colors[0], colors[1], colors[2]));
g.fillRect(x, y, width, height);
// 绘制数字
g.setFont(new Font("黑体",Font.PLAIN, fontSize));
g.setColor(new Color(31, 31, 31));
g.drawString(number, x+(width/4), y+(height/numberLength));
}
}
// 绘制活动方块
int x = activitedBlock.pos_x*(size+distance);
int y = activitedBlock.pos_y*(size+distance);
int width = size-distance;
int height = size-distance;
Graphics2D graphics2d = (Graphics2D)g;
graphics2d.setColor(Color.RED);
graphics2d.setStroke(new BasicStroke(distance/2, BasicStroke.CAP_ROUND, BasicStroke.JOIN_ROUND));
graphics2d.drawRect(x, y, width, height);
}
// 方块矩阵移动
public void move(int direction){
System.out.println("方块矩阵移动");
int row = activitedBlock.pos_x;//lie
int line = activitedBlock.pos_y;//hang
System.out.println("当前活动块的位置"+activitedBlock.pos_y+":"+activitedBlock.pos_x);
switch (direction) {
case KeyEvent.VK_W:
row = count_x;
for(int r=0; r < row; r++){
for(int l=0; l < line; l++){
Block top = blocks[l][r];
System.out.println(top.pos_y+":"+top.pos_x+"="+top.number);
Block botton = blocks[l+1][r];
if(top.number == botton.number){
this.scope += top.number;
top.merge();
System.out.println("匹配"+top.pos_y+":"+ top.pos_x+"-"+botton.pos_y+":"+botton.pos_x);
System.out.println("合并后移动剩下的块");
//
for(int iline=l+1; iline < count_y-1; iline++){
blocks[iline][r] = blocks[iline+1][r];
blocks[iline][r].move(KeyEvent.VK_W);
System.out.println("移动"+blocks[iline][r].pos_y+"行"+blocks[iline][r].pos_x+"列="+blocks[iline][r].number);
}
System.out.println("生成"+(count_y-1)+"行"+r+"列=");
blocks[count_y-1][r] = Block.random(r, count_y-1);
break;
}
}
}
break;
case KeyEvent.VK_S:
row = count_x;
for(int r=0; r < row; r++){
for(int l=count_y-1; l > line; l--){
Block botton = blocks[l][r];
System.out.println(botton.pos_y+":"+botton.pos_x+"="+botton.number);
Block top = blocks[l-1][r];
if(top.number == botton.number){
this.scope += botton.number;
botton.merge();
System.out.println("匹配"+botton.pos_y+":"+ botton.pos_x+"-"+top.pos_y+":"+top.pos_x+"="+botton.number);
System.out.println("合并后移动剩下的块");
//
for(int iline=l-1; iline > 0; iline--){
blocks[iline][r] = blocks[iline-1][r];
blocks[iline][r].move(KeyEvent.VK_S);
System.out.println("上一行移动到"+blocks[iline][r].pos_y+"行"+blocks[iline][r].pos_x+"列="+blocks[iline][r].number);
}
System.out.println("生成"+(0)+"行"+r+"列=");
blocks[0][r] = Block.random(r, 0);
break;
}
}
}
break;
case KeyEvent.VK_A:
line = count_y;
for(int l=0; l < line; l++){
for(int r=0; r < row; r++){
Block left = blocks[l][r];
System.out.println(left.pos_y+":"+left.pos_x+"="+left.number);
Block right = blocks[l][r+1];
if(left.number == right.number){
this.scope += left.number;
left.merge();
System.out.println("匹配"+left.pos_y+":"+ left.pos_x+"-"+right.pos_y+":"+right.pos_x+"="+right.number);
System.out.println("合并后移动剩下的块");
//
for(int irow=r+1; irow < count_x-1; irow++){
blocks[l][irow] = blocks[l][irow+1];
blocks[l][irow].move(KeyEvent.VK_A);
System.out.println("上一行移动到"+blocks[l][irow].pos_y+"行"+blocks[l][irow].pos_x+"列="+blocks[l][irow].number);
}
System.out.println("生成"+(l)+"行"+4+"列=");
blocks[l][4] = Block.random(4, l);
break;
}
}
}
break;
case KeyEvent.VK_D:
line = count_y;
for(int l=0; l < line; l++){
for(int r=count_x-1; r > row; r--){
Block right = blocks[l][r];
System.out.println(right.pos_y+":"+right.pos_x+"="+right.number);
Block left = blocks[l][r-1];
if(left.number == right.number){
this.scope += right.number;
right.merge();
System.out.println("匹配"+left.pos_y+":"+ left.pos_x+"-"+right.pos_y+":"+right.pos_x+"="+right.number);
System.out.println("合并后移动剩下的块");
for(int irow=r-1; irow > 0; irow--){
blocks[l][irow] = blocks[l][irow-1];
blocks[l][irow].move(KeyEvent.VK_D);
System.out.println("上一行移动到"+blocks[l][irow].pos_y+"行"+blocks[l][irow].pos_x+"列="+blocks[l][irow].number);
}
System.out.println("生成"+(l)+"行"+0+"列=");
blocks[l][0] = Block.random(0, l);
break;
}
}
}
break;
default:
break;
}
}
}
2.5 启动类
package com.tudou;
public class Test {
public static void main(String[] args) {
Grassdurian grassdurian = new Grassdurian(5, 5, 100, 10);
grassdurian.run();
}
}
获取源码，公众号回复【1024】，即可。更多最新Java面试题加群、见群公告。~
不会还有人没 点赞 + 关注 + 收藏 吧!
扫一扫
375
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
