小翼俄罗斯方块java代码

package entity; import java.awt.Point; import java.util.ArrayList; import java.util.List; public class GameAct { /* * 定义小方块类型编号 */ private int typeCode; public int getTypeCode() { return typeCode; } //定义旋转判断常量 private static int MIN_X=0; private static int MAX_X=9; private static int MIN_Y=0; private static int MAX_Y=17; //定义存放小方块的数组point组件是javaswing提供的 private Point[] actPoints; //定义静态变量数组，存放七个小方块 private static List<Point[]>TYPE_CONFIG; static{ //TODO 需要写进配置文件，后续处理 TYPE_CONFIG=new ArrayList<Point[]>(9); TYPE_CONFIG.add(new Point[]{new Point(4,0),new Point(3,0),new Point(5,0),new Point(5,1)}); TYPE_CONFIG.add(new Point[]{new Point(4,0),new Point(3,0),new Point(4,1),new Point(5,1),}); TYPE_CONFIG.add(new Point[]{new Point(4,0),new Point(3,0),new Point(5,0),new Point(6,0),}); TYPE_CONFIG.add(new Point[]{new Point(4,0),new Point(3,0),new Point(5,0),new Point(4,1),}); TYPE_CONFIG.add(new Point[]{new Point(4,0),new Point(3,0),new Point(5,0),new Point(3,1),}); TYPE_CONFIG.add(new Point[]{new Point(4,0),new Point(5,0),new Point(3,1),new Point(4,1),}); TYPE_CONFIG.add(new Point[]{new Point(4,0),new Point(5,0),new Point(4,1),new Point(5,1),}); } public GameAct(){ //TODO TYPE_CODE需要补上 this.init(typeCode); } public Point[] getActPoints() { return actPoints; } /* * 小方块移动方法 * */ public boolean move(int moveX,int moveY,boolean[][] gameMap){ //边界判定，将小方块控制在UiBaseGame框框中 //move方法就是讲point[]数组中的坐标全部都加moveX，或者moveY for (int i = 0; i <actPoints.length; i++) { //actPoints[i].x+moveX; //actPoints[i].y+moveY; int newX=actPoints[i].x+moveX; int newY=actPoints[i].y+moveY; if(!overZone(newX, newY,gameMap)) return false; } for (int i = 0; i <actPoints.length; i++) { actPoints[i].x+=moveX; actPoints[i].y+=moveY; } return true; } /* * 方块旋转算法函数 * 顺时针： B.x = O.x - O.y + A.y B.y = O.x + O.y - A.x * */ public void round(boolean[][] gameMap){ //TODO 硬编码方块不需要旋转 if(typeCode==6){ return; } int newX=0; int newY=0; for (int i = 1; i < actPoints.length; i++) { newX=actPoints[0].x-actPoints[0].y+actPoints[i].y; newY=actPoints[0].x+actPoints[0].y-actPoints[i].x; if(!overZone(newX, newY,gameMap)) return; } for(int i = 1; i < actPoints.length; i++){ //TODO判断是否可以旋转 newX=actPoints[0].x-actPoints[0].y+actPoints[i].y; newY=actPoints[0].x+actPoints[0].y-actPoints[i].x; actPoints[i].x=newX; actPoints[i].y=newY; } } /* * 判断每一个小方块是否都可以旋转，若每一个都可以旋转，则在将方块整体旋转，否则直接退出 * 将gameMap二维数组传递进来进行判断：解决小方块堆积问题 * 在move()方法和round()方法中都需要解决小方块堆积问题 * */ private boolean overZone(int newX,int newY,boolean[][] gameMap){ // newX=actPoints[0].x-actPoints[0].y+actPoints[i].y; //newY=actPoints[0].x+actPoints[0].y-actPoints[i].x; if (newX<MIN_X||newX>MAX_X||newY<MIN_Y||newY>MAX_Y||gameMap[newX][newY]) { return false; } return true; } public void init(int typeCode) { this.typeCode=typeCode; // TODO 硬编码问题，后续解决 /* * 小方块随机出现可以使用switch case分支来解决，但可以使用算法优化：使用数组映射来解决 */ //获得list中point数组对象 Point[] tempPoints=TYPE_CONFIG.get(typeCode); //新定义actPoints数组，并指定长度 actPoints=new Point[tempPoints.length]; //将临时tempPoint数组中的值传递给actPoint数组 for (int i = 0; i < tempPoints.length; i++) { actPoints[i]=new Point(tempPoints[i].x,tempPoints[i].y); } /* * switch case分支算法可以解决小方块随机出现的问题，新手，考试，面试时候使用 * 随机生成一个0-6的整数new Random().nextInt(6); switch (typeCode) { case 0: actPoints=new Point[]{new Point(4,0),new Point(3,0),new Point(5,0),new Point(5,1),}; break; case 1: actPoints=new Point[]{new Point(4,0),new Point(3,0),new Point(4,1),new Point(5,1),}; break; case 2: actPoints=new Point[]{new Point(4,0),new Point(3,0),new Point(5,0),new Point(6,0),}; break; case 3: actPoints=new Point[]{new Point(4,0),new Point(3,0),new Point(5,0),new Point(4,1),}; break; case 4: actPoints=new Point[]{new Point(4,0),new Point(3,0),new Point(5,0),new Point(3,1),}; break; case 5: actPoints=new Point[]{new Point(4,0),new Point(5,0),new Point(3,1),new Point(4,1),}; break; default: actPoints=new Point[]{new Point(4,0),new Point(5,0),new Point(4,1),new Point(5,1),}; break; } */ } }