mine.java

来自「全是好玩的小程序全是好玩的小程序全是好玩的小程序」· Java 代码 · 共 96 行

package day04;

public class Mine {
	public static void main(String[] args) {
	int[][] data=new int[10][10];
	int i=0;
	while(i<30){
	int x=(int)(Math.random()*10);
	int y=(int)(Math.random()*10);
	if(data[x][y]!=-1){
		data[x][y]=-1;
		i++;
	}
	
	}
	mineCheck(data);
	minePrint(data);

}
	
public static void minePrint(int[][] data){
	for(int i=0;i<data.length;i++){
		for(int j=0;j<data[i].length;j++)
		if(data[i][j]==-1)	System.out.print("*"+"\t\t\t");
		else System.out.print(data[i][j]+"\t\t\t");
	System.out.println();
	}
}
public static void mineCheck(int[][] data ){
for(int i=0;i<data.length;i++){
	for(int j=0;j<data[i].length;j++){
		int mineNum=0;
		if(data[i][j]!=-1){
		if(zuoShang(data,i,j))mineNum++;
		if(zhongShang(data,i,j))mineNum++;
		if(youShang(data,i,j))mineNum++;
		if(zuo(data,i,j))mineNum++;
		if(you(data,i,j))mineNum++;
		if(zuoXia(data,i,j))mineNum++;
		if(zhongXia(data,i,j))mineNum++;
		if(youXia(data,i,j))mineNum++;
		data[i][j]=mineNum;
		}
	}
}
}
public static boolean zuoShang(int[][] data,int i,int j){
	if(i>0&&j>0){
		if(data[i-1][j-1]==-1)return true;
	}
 return false;
}
public static boolean zhongShang(int[][] data,int i,int j){
	if(i>0){
		if(data[i-1][j]==-1)return true;
	}
 return false;
}
public static boolean youShang(int[][] data,int i,int j){
	if(i>0&&j<data[i].length-1){
		if(data[i-1][j+1]==-1)return true;
	}
 return false;
}
public static boolean zuo(int[][] data,int i,int j){
	if(j>0){
		if(data[i][j-1]==-1)return true;
	}
 return false;
}
public static boolean you(int[][] data,int i,int j){
	if(j<data[i].length-1){
		if(data[i][j+1]==-1)return true;
	}
 return false;
}
public static boolean zuoXia(int[][] data,int i,int j){
	if(i<data.length-1&&j>0){
		if(data[i+1][j-1]==-1)return true;
	}
 return false;
}
public static boolean zhongXia(int[][] data,int i,int j){
	if(i<data.length-1){
		if(data[i+1][j]==-1)return true;
	}
 return false;
}
public static boolean youXia(int[][] data,int i,int j){
	if(i<data.length-1&&j<data[i].length-1){
		if(data[i+1][j+1]==-1)return true;
	}
 return false;
}

}