⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 fang.java

📁 JAVA聊天系统实验报告!内含完整实验报告!
💻 JAVA
📖 第 1 页 / 共 2 页
字号:
	    	  this.fuzhi();     	 	
	    	}
	    	if(count==3){    		
	    		int m[][]={{0,0,0,1},{0,1,1,1},{0,0,0,0},{0,0,0,0}};//L+270度
	    		 for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	   while(y<3){
	    	      y++;
	    	    }
	    	    while(y+3>18){
	    	    	y--;
	    	    }
	    	   this.fuzhi(); 	    	 	
	    	}
	    	if(count==4){	    		
	    		int m[][]={{0,0,1,0},{0,0,1,0},{0,0,1,1},{0,0,0,0}};//L+360度
	    		 for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	    while(y<2){
	    	      y++;
	    	    }	    	    
	    	    while(y+3>18){
	    	    	y--;
	    	    }
	    	   this.fuzhi(); 
	    	 	count=0;
	    	}
	    	}	     
	   if(b==2){	   	
	   	if(count==1){    	   
	    	    int m[][]= {{0,1,0,0},{0,1,1,1},{0,0,0,0},{0,0,0,0}};//90
	    	    for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	    while(y<3){
	    	      y++;
	    	    }	    	    
	    	    while(y+3>18){
	    	    	y--;
	    	    }
	    	   this.fuzhi(); 	    	  
	    	}
	    	if(count==2){	    	   
	    		int m[][]={{0,0,1,1},{0,0,1,0},{0,0,1,0},{0,0,0,0}};//180
	    		 for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	    while(y<2){
	    	      y++;
	    	    }
	    	    while(y+3>18){
	    	    	y--;
	    	    }	    	    
	    	    while(a[x+3][y]==1){
	    	    	x--;
	    	    }
	    	  this.fuzhi(); 
	    	}
	    	if(count==3){	    		
	    		int m[][]={{0,1,1,1},{0,0,0,1},{0,0,0,0},{0,0,0,0}};//270
	    		 for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	    while(y<3){
	    	      y++;
	    	    }	    	     
	    	    while(y+3>18){
	    	    	y--;
	    	    }
	    	  this.fuzhi();     	 	
	    	}
	    	if(count==4){	    		
	    	int m[][]={{0,0,1,0},{0,0,1,0},{0,1,1,0},{0,0,0,0}};//360
	    		 for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	    while(y<3){
	    	      y++;
	    	    }
	    	    while(y+2>18){
	    	    	y--;
	    	    }	    	    
	    	   this.fuzhi(); 
	    	 	count=0;
	    	}	    	
	      }
	   if(b==4){
	   	   if(count==1){	    	   
	    	    int m[][]= {{0,0,1,0},{0,1,1,0},{0,1,0,0},{0,0,0,0}};
	    	    for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    } 
	    	    while(y<3){
	    	      y++;
	    	    }
	    	    while(y+2>18){
	    	    	y--;
	    	    }
	    	    while(a[x+2][y+1]==1){
	    	    	x--;
	    	    }	    	    
	    	    this.fuzhi(); 
	    	}
	    	if(count==2){	    	   
	    		int m[][]={{0,1,1,0},{0,0,1,1},{0,0,0,0},{0,0,0,0}};
	    		 for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }	    	   
	    	    while(y<3){
	    	      y++;
	    	    }
	    	    while(y+3>18){
	    	    	y--;
	    	    }
	    	 this.fuzhi(); 
	    	 count=0;	
	    	}	    	 
	   }
	   if(b==5){
	   	if(count==1){    	   
	    	    int m[][]= {{0,1,0,0},{0,1,1,0},{0,0,1,0},{0,0,0,0}};
	    	    for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    } 
	    	    while(y<3){
	    	      y++;
	    	    }
	    	    while(y+2>18){
	    	    	y--;
	    	    }
	    	    while(a[x+2][y+2]==1){
	    	    	x--;
	    	    }	    	    
	    	  this.fuzhi(); 
	    	}
	    	if(count==2){	    	   
	    		int m[][]={{0,0,1,1},{ 0,1,1,0},{0,0,0,0},{0,0,0,0}};
	    		 for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	     while(y<3){
	    	    	y++;
	    	    }
	    	   while(y+3>18){
	    	    	y--;
	    	    }
	    	   this.fuzhi(); 
	    	 count=0;	
	    	}	     
	   }
	   if(b==6){	   	
	   		if(count==1){    	   
	    	    int m[][]= {{0,0,0,1},{0,0,1,1},{0,0,0,1},{0,0,0,0}};//90
	    	    for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	      while(y<2){
	    	    	y++;
	    	    }	    	     
	    	    while(y+3>18){
	    	    	y--;
	    	    }
	    	    while(a[x+1][y+1]==1||a[x+1][y+3]==1){
	    	    	x--;
	    	    }
	    	   this.fuzhi(); 
	    	}
	    	if(count==2){	    	   
	    		int m[][]={{0,0,1,0},{0,1,1,1},{0,0,0,0},{0,0,0,0}};//180
	    		 for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	    while(y<3){
	    	    	y++;
	    	    }	    	    
	    	    while(a[x+2][y+2]==1){
	    	    	x--;
	    	    }
	    	    while(y+2>18){
	    	    	y--;
	    	    }
	    	 this.fuzhi(); 
	    	}
	    	if(count==3){	    		
	    		int m[][]={{0,0,1,0},{0,0,1,1},{0,0,1,0},{0,0,0,0}};//270
	    		 for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	     while(y<2){
	    	     	y++;
	    	     }
	    	     while(a[x+2][y+2]==1){
	    	     
	    	     	x--;
	    	     }	    	      
	    this.fuzhi(); 
	    	}	    	
	     	if(count==4){	    		
	    		int m[][]={{0,1,1,1},{0,0,1,0},{0,0,0,0},{0,0,0,0}};//360
	    		 for(int i=0;i<4;i++){
	    	    	for(int j=0;j<4;j++){
	    	    		kuai.l[b][i][j]=m[i][j];
	    	    	}
	    	    }
	    	     while(y<3){
	    	      y++;
	    	    }
	    	    while(y+3>18){
	    	    	y--;
	    	    }
	    	    while(a[x+1][y+1]==1){
	    	    	x--;
	    	    }
	    	   this.fuzhi(); 	    		
	    	 count=0;	
	    	}	   	    
	     }	      
	   }	     	
	 }			
	}
	public void keyReleased(KeyEvent e){
		if(e.getKeyCode()==38){			 
		}		
	}
	public void keyTyped(KeyEvent e){
	}	
	public void xialuo(){
		if(!stop()){     
		for(int i=0;i<4;i++){
			for(int j=0;j<4;j++){
				if(kuai.l[b][i][j]==1){
                a[x+i][y+j]=0;
                l[x+i][y+j-4].setBackground(p1.getBackground());          
				}
			}
		}
		x++;		
	this.fuzhi(); 
	}
	}	
	public boolean stop(){
		for(int i=0;i<4;i++){
			for(int j=0;j<4;j++){
				if(kuai.l[b][i][j]==1&&(x+i)==19){		  
					go=true;
				}
				if(i<3){
					if(kuai.l[b][i][j]==1&&kuai.l[b][i+1][j]==0&&a[x+i+1][j+y]==1){
				 	go=true;
				 }
				}
				if(i==3){
					if(kuai.l[b][i][j]==1&&a[x+i+1][j+y]==1){
						go=true;
					}
				}	
			}
		}
		
		return go;
	}
	public boolean canl(){
	 for(int i=0;i<4;i++){
			for(int j=0;j<4;j++){ 
				if(0<j&&j<4){
					if(kuai.l[b][i][j]==1&&kuai.l[b][i][j-1]==0&&a[x+i][j+y-1]==1){
				 	 fi=false;
				 }
				 if(kuai.l[b][i][j]==1&&y==(4-j)){
				 	fi=false;
				 }
				}
			  	if(j==0){
					if(kuai.l[b][i][j]==1&&a[x+i][j+y-1]==1){
					 fi=false;
					} 
					if(kuai.l[b][i][j]==1&&y==(4-j)){
				 	fi=false;
				 }
				}	
			}
		}
	 return fi;		
	}
		public boolean canr(){
	 for(int i=0;i<4;i++){
			for(int j=0;j<4;j++){		 
				if(j<3){
					if(kuai.l[b][i][j]==1&&kuai.l[b][i][j+1]==0&&a[x+i][j+y+1]==1){
				 	 ri=false;
				 }
				 if(kuai.l[b][i][j]==1&&y==(18-j)){
				 	ri=false;
				 }			 
				}
			  	if(j==3){
					if(kuai.l[b][i][j]==1&&a[x+i][j+y+1]==1){
					 ri=false;
					} 
					if(kuai.l[b][i][j]==1&&y==(18-j)){
				 	ri=false;
				 }
				}							
			}
		}
	 return ri;		
	}
	public boolean kebian(){
		for(int i=0;i<4;i++){
			for(int j=0;j<4;j++){
				if(a[x+4][y+j]==1||a[x+i][y+4]==1){
					to=false;
				} 				 			 
			}
		}
		return to;
	}		 	
	public boolean candelet(){	 
	  for(int i=19;i>=0;i--)
	         {
		      	int qq=1;   
			for(int j=4;j<19;j++){
				qq=Math.min(qq,a[i][j]);
			}
			if(qq==1){
				this.zou=true;
				beishu++;	
	} 	
	}
	return zou;
	}
	public void defen(){		
	if(this.candelet()){	
		 int i=19;	
	   while(i>0){
		      	int qq=1;   
			for(int j=4;j<19;j++){
				qq=Math.min(qq,a[i][j]);
			}
			if(qq==1){
				fenshu+=20+(beishu-1)*5;
				label.setText(""+fenshu);
				x++;
				for(int n=4;n<19;n++){
					a[i][n]=0;
				}
			 for(int m=i;m>0;m--){
			 	for(int j=4;j<19;j++){
			 		a[m][j]=a[m-1][j];
			 	}
			 }
			 i++;
			 	for(int mm=0;mm<20;mm++){
			for(int nn=0;nn<15;nn++){
				if(a[mm][nn+4]==0){
					l[mm][nn].setBackground(p1.getBackground());					
				}
				if(a[mm][nn+4]==1){
					l[mm][nn].setBackground(Color.red);				
				}
			 }
		    }				 
		  }
		 i--;
		}
	  }
	}	
	public static void main(String s[]){
		fang f=new fang();
		f.show();
	}
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -