您的位置：首页 > 运维架构

oop 连连看游戏

2016-07-23 16:48 411 查看 
 class link //棋盘
public class link{
private int cols;
private int rows;
private int [][]board;
private int  level;
Random rd=new Random;
public void init{
Scanner sc=new Scanner(System.in);
		do{
			System.out.println("请输入行数。。");
cols=sc.nextInt();
}while(cols<2);
		do{System.out.println("请输入列数。。");rows=sc.nextInt();}while(rows<2||ros%2!=0);do{System.out.println("请输入游戏等级");level=sc.nextInt();}while(level<2||level>20);sc.nextLine();borad=new int[cols][rows];	}//生成棋盘public void genBoard(int boead[][],int level){if(board==null){return;}for(int i=1;i<board.length-1;i++){for(int j=1;j<board[i].length-1;j+=2){board[i][j]=rd.nextInt(level)+1;board[i][j+1]=board[i][j];}}}     //保证了每列的元素最终相同
********
*1217->122015->2089->8*
*1313991212*
*13137799*
*1414661313*
********
	//打乱棋盘public void shuffle (int board[][]){//打乱棋盘if(board==null){return;}for(int i=0;i<board.length*board[0].length*200;i++){//打乱循环的次数 保证循环很多次int x1=rd.nextInt(board.length-2)+1;int y1=rd.nextInt(board[0].length-2)+1;int x2=rd.nextInt(board.length-2)+1;int y2=rd.nextInt(board[0].length-2)+1;int temp=board[x1][y1];board[x1][y1]=board[x2][y2];board[x2][y2]=temp;}}
	//展示列数
	public void showCols(int [][]board){
		if(board==null){
			return;
		}
		for(int i=0;i<=board[0].length-1;i++){
			if(i==0){
				System.out.print("\t");
			}else{
				System.out.print{i+"\t"};
			}
		}
		System.out.println();
	}
        //显示棋盘public void showBoard(int [][]board){//显示列号showCols(board);for(int i=0;i<board.length;i++){for(int j=0;j<board[i].length;j++){if(i==0||i==board.length-1||j==0||j==board[i].length-1){if((i==0&&j==0)||(i==0&&j==board[i].length-1)||(i==board.length-1&&j==0)||(i==board.length-1&&j==board[i].length-1)){System.out.print("\t");}else if(i!=0&&i!=board.length-1&&j==0){System.out.print(i+"*\t");}else if(i!=0&&i!=board.length-1&&j==board[i].length-1){System.out.print("*"+i);}else{System.out.print("*\t");}}else if(board[i][j]==0){System.out.print("\t");}else{System.out.print(board[i][j]+"\t");}}System.out.println();}showCols(board);}public int [][] getBoard(){return board;}
}

                                            

                                        

                        
                        内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 点击这里给我发消息 
                    

                    

                    

                        

                         标签： 
                                                

                        

                    


                

            


            

                
相关文章推荐

                

                
            

        

        

            

            
            

                

                    
新的分享

                    

                        
                    

                

            


            

                

                    
章节导航