Java扫雷

import java.util.Scanner;
import java.util.Random;
public class hmr09 {
  public static void main(String[] args) {
		// TODO Auto-generated method stub
            int [][]area=new int[6][6];
        	//System.out.println(area[0][0]);
            System.out.println("请输入雷的个数");
            Scanner sc=new Scanner(System.in);
            int num=sc.nextInt();
            //如果雷的个数比例num/6*6小于20%或大于75%不合法
            if((double)num/36<0.2||(double)num/36>0.75){
            	System.out.println("不合法");
            	return;
            }
            Random r=new Random();
            int count=0;
            while(count<num){
            	int x=r.nextInt(6);
            	int y=r.nextInt(6);
            	if(area[x][y]==0){
            		area[x][y]=-1;
            		count++;
            	}
            }
   /*循环显示雷区的*/
            for(int x=0;x<area.length;x++){
            	for(int y=0;y<area.length;y++){
            		System.out.print(area[x][y]+"   ");
            	}
            	System.out.println();
            }
            for(int x=0;x<area.length;x++){
            	for(int y=0;y<area.length;y++){
            		if(area[x][y]==0){
            			//统计周围雷的个数
            			count=0;
            			/*左侧*/if(y-1<0 && area[x][y-1]==-1){
            				count++;
            			}
            		    /*左上*/if(x-1>=0 && y-1>=0 && area[x-1][y-1]==-1 ){
            		    	count++;
            		    }
            		    /*正上*/if(x-1>=0 && area[x][y]==-1){
            		    	count++;
            		    }
            		    /*右上*/if(x-1>=0 && y+1<=area[x].length-1 && area[x-1][y+1]==-1){
            		    	count++;
            		    }
            		    /*正右*/if(y+1<=area[x].length-1 && area[x][y+1]==-1){
            		    	count++;
            		    }
            		    /*左下*/if(x+1<=area.length-1 && y-1>=0 && area[x+1][y-1]==-1 ){
            		    	count++;
            		    } 
            		    /*正下*/if(x+1<=area.length-1 &&area[x+1][y]==-1){
            		    	count++;
            	       }
            		    /*右下*/if(x+1<=areea.length-1 && y+1<=area[x].length-1 && area[x+1][y+1]==-1){
            		    	count++;
            		    }
            	        area[x][y]=count;
             }
  	  }
            } 
   }