控制台版java 2048

package com;


import java.io.BufferedReader;
import java.io.Console;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;


public class g2048 {
public static void main(String[] args) {//wasd 方向
try {
startg2048();
} catch (Exception e) {
e.printStackTrace();
}
}
public static void startg2048() throws Exception{
int[][] g2048 = new int[4][4];
g2048 = newNum(g2048);
System.out.println(" ");
g2048 = newNum(g2048);
while(true){
Scanner sa =new Scanner(System.in);
String a = sa.nextLine();
if("w".equalsIgnoreCase(a)){
g2048 = up(g2048);
}else if("a".equalsIgnoreCase(a)){
g2048 = left(g2048);
}else if("s".equalsIgnoreCase(a)){
g2048 = down(g2048);
}else if("d".equalsIgnoreCase(a)){
g2048 = right(g2048);
}else{
continue;
}
}
}
private static int[][] right(int[][] g2048) {
int flag = 0;
for (int i = 0; i < g2048.length; i++) {
boolean has0 = false;
for (int j = g2048.length-1; j >=0; j--){
if(j>0){
if(g2048[i][j-1]==g2048[i][j]&&g2048[i][j]!=0){
flag++;
break;
}
}
if(g2048[i][j]==0){
has0 = true;
}
if(has0&&g2048[i][j]>0){
flag++;
break;
}
}
}
if(flag<1){
return g2048;
}
for (int i = 0; i < g2048.length; i++) {
int[] newAry = new int[g2048.length];
int k = 0;
for (int j = g2048.length-1; j >= 0; j--) {
if(g2048[i][j]==0){
continue;
}
newAry[k++] = g2048[i][j];
}
for (int j = 0; j < newAry.length-1; j++) {
if(newAry[j]==newAry[j+1]){
newAry[j] = 2*newAry[j];
newAry[j+1] = 0;
}
}
int []newAry2 = newAry;
newAry = new int[newAry2.length];
int l = 0;
for (int j = 0; j < newAry2.length; j++) {
if(newAry2[j]!=0){
newAry[l++] = newAry2[j];
}
}
for (int j = g2048.length-1; j >=0; j--) {
g2048[i][j] = newAry[g2048.length-1-j];
}
}
g2048 = newNum(g2048);
return g2048;
}
private static int[][] down(int[][] g2048) {
int flag = 0;
for (int i = 0; i < g2048.length; i++) {
boolean has0 = false;
for (int j =  g2048.length-1; j >= 0 ; j--){
if(j>0){
if(g2048[j-1][i]==g2048[j][i]&&g2048[j][i]!=0){
flag++;
break;
}
}
if(g2048[j][i]==0){
has0 = true;
}
if(has0&&g2048[j][i]>0){
flag++;
break;
}
}
}
if(flag<1){
return g2048;
}
for (int i = 0; i < g2048.length; i++) {
int[] newAry = new int[g2048.length];
int k = 0;
for (int j =  g2048.length-1; j >= 0 ; j--){
if(g2048[j][i]==0){
continue;
}
newAry[k++] = g2048[j][i];
}
for (int j = 0; j < newAry.length-1; j++) {
if(newAry[j]==newAry[j+1]){
newAry[j] = 2*newAry[j];
newAry[j+1] = 0;
}
}
int []newAry2 = newAry;
newAry = new int[newAry2.length];
int l = 0;
for (int j = 0; j < newAry2.length; j++) {
if(newAry2[j]!=0){
newAry[l++] = newAry2[j];
}
}
for (int j =  g2048.length-1; j >= 0 ; j--){
g2048[j][i] = newAry[g2048.length-1-j];
}
}
g2048 = newNum(g2048);
return g2048;
}
private static int[][] left(int[][] g2048) {
int flag = 0;
for (int i = 0; i < g2048.length; i++) {
boolean has0 = false;
for (int j = 0; j < g2048.length; j++){
if(j>0){
if(g2048[i][j-1]==g2048[i][j]&&g2048[i][j]!=0){
flag++;
break;
}
}
if(g2048[i][j]==0){
has0 = true;
}
if(has0&&g2048[i][j]>0){
flag++;
break;
}
}
}
if(flag<1){
return g2048;
}
for (int i = 0; i < g2048.length; i++) {
int[] newAry = new int[g2048.length];
int k = 0;
for (int j = 0; j < g2048.length; j++) {
if(g2048[i][j]==0){
continue;
}
newAry[k++] = g2048[i][j];
}
for (int j = 0; j < newAry.length-1; j++) {
if(newAry[j]==newAry[j+1]){
newAry[j] = 2*newAry[j];
newAry[j+1] = 0;
}
}
int []newAry2 = newAry;
newAry = new int[newAry2.length];
int l = 0;
for (int j = 0; j < newAry2.length; j++) {
if(newAry2[j]!=0){
newAry[l++] = newAry2[j];
}
}
for (int j = 0; j < g2048.length; j++) {
g2048[i][j] = newAry[j];
}
}
g2048 = newNum(g2048);
return g2048;
}
private static int[][] up(int[][] g2048) {
int flag = 0;
for (int i = 0; i < g2048.length; i++) {
boolean has0 = false;
for (int j = 0; j < g2048.length; j++){
if(j>0){
if(g2048[j-1][i]==g2048[j][i]&&g2048[j][i]!=0){
flag++;
break;
}
}
if(g2048[j][i]==0){
has0 = true;
}
if(has0&&g2048[j][i]>0){
flag++;
break;
}
}
}
if(flag<1){
return g2048;
}
for (int i = 0; i < g2048.length; i++) {
int[] newAry = new int[g2048.length];
int k = 0;
for (int j = 0; j < g2048.length; j++) {
if(g2048[j][i]==0){
continue;
}
newAry[k++] = g2048[j][i];
}
for (int j = 0; j < newAry.length-1; j++) {
if(newAry[j]==newAry[j+1]){
newAry[j] = 2*newAry[j];
newAry[j+1] = 0;
}
}
int []newAry2 = newAry;
newAry = new int[newAry2.length];
int l = 0;
for (int j = 0; j < newAry2.length; j++) {
if(newAry2[j]!=0){
newAry[l++] = newAry2[j];
}
}
for (int j = 0; j < g2048.length; j++) {
g2048[j][i] = newAry[j];
}
}
g2048 = newNum(g2048);
return g2048;
}
public static int[][] newNum(int[][] g2048){
while(true){
int raC = (int)(Math.random()*4);
int raR = (int)(Math.random()*4);
System.out.println(raC);
if(g2048[raC][raR]==0){
if(Math.random()>0.5){
g2048[raC][raR]=2;
}else{
g2048[raC][raR]=4;
}
break;
}
}
for (int[] row : g2048) {
for (int i : row) {
String outS = "";
if(i==0){
outS = "____";
}else{
for (int j = 4; j >String.valueOf(i).length(); j--) {
outS += "_";
}
outS += i;
}
System.out.print(i==0?"____":outS);System.out.print("|");
}
System.out.println();
}
return g2048;
}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值