changlian.java

JAVA 写的五子棋

public class ChangLian {
	public boolean changlian(int m,int n,int pq[][]){
		int left=0;
		int right=0;
		int above=0;
		int below=0;
		int skewabove=0;
		int skewbelow=0;
		int tiltedabove=0;
		int tiltedbelow=0;
		
		if(pq[m][n]==1){
			int a=0;
			for(a=m-1;a>=0;a--){
				if(pq[a][n]==1){
					left=left+1;
				}
				else{
					break;
				}
			}
			int b=0;
			for(b=m+1;b<15;b++){
				if(pq[b][n]==1){
					right=right+1;
				}
				else{
					break;
				}
			}
			
			int c=0;
			for(c=n-1;c>=0;c--){
				if(pq[m][c]==1){
					above=above+1;
				}
				else{
					break;
				}
			}
			int d=0;
			for(d=n+1;d<15;d++){
				if(pq[m][d]==1){
					below=below+1;
				}
				else{
					break;
				}
			}
			int e=0,f=0;
			for(e=m-1,f=n-1;e>=0&&f>=0;e--,f--){
				if(pq[e][f]==1){
					skewabove=skewabove+1;
				}
				else{
					break;
				}
			}

			int g=0,h=0;
			for(g=m+1,h=n+1;g<15&&h<15;g++,h++){
				if(pq[g][h]==1){
					skewbelow=skewbelow+1;
				}
				else{
					break;
				}
			}
			
			int e1=0,f1=0;
			for(e1=m+1,f1=n-1;e1<15&&f1>=0;e1++,f1--){
				if(pq[e1][f1]==1){
					tiltedabove=tiltedabove+1;
				}
				else{
					break;
				}
			}
			int g1=0,h1=0;
			for(g1=m-1,h1=n+1;g1>=0&&h1<15;g1--,h1++){
				if(pq[g1][h1]==1){
					tiltedbelow=tiltedbelow+1;
				}
				else{
					break;
				}
			}

			if((right+left)>4||(above+below)>4||(skewabove+skewbelow)>4||(tiltedabove+tiltedbelow)>4){
				return true;
			}
		}
		
		
		int left1=0;
		int right1=0;
		int above1=0;
		int below1=0;
		int skewabove1=0;
		int skewbelow1=0;
		int tiltedabove1=0;
		int tiltedbelow1=0;
		
		if(pq[m][n]==-1){
			int a=0;
			for(a=m-1;a>=0;a--){
				if(pq[a][n]==-1){
					left1=left1+1;
				}
				else{
					break;
				}
			}
			int b=0;
			for(b=m+1;b<15;b++){
				if(pq[b][n]==-1){
					right1=right1+1;
				}
				else{
					break;
				}
			}
			
			int c=0;
			for(c=n-1;c>=0;c--){
				if(pq[m][c]==-1){
					above1=above1+1;
				}
				else{
					break;
				}
			}
			int d=0;
			for(d=n+1;d<15;d++){
				if(pq[m][d]==-1){
					below1=below1+1;
				}
				else{
					break;
				}
			}
			int e=0,f=0;
			for(e=m-1,f=n-1;e>=0&&f>=0;e--,f--){
				if(pq[e][f]==-1){
					skewabove1=skewabove1+1;
				}
				else{
					break;
				}
			}
			int g=0,h=0;
			for(g=m+1,h=n+1;g<15&&h<15;g++,h++){
				if(pq[g][h]==-1){
					skewbelow1=skewbelow1+1;
				}
				else{
					break;
				}
			}
			int e1=0,f1=0;
			for(e1=m+1,f1=n-1;e1<15&&f1>=0;e1++,f1--){
				if(pq[e1][f1]==-1){
					tiltedabove1=tiltedabove1+1;
				}
				else{
					break;
				}
			}
			int g1=0,h1=0;
			for(g1=m-1,h1=n+1;g1>=0&&h1<15;g1--,h1++){
				if(pq[g1][h1]==-1){
					tiltedbelow1=tiltedbelow1+1;
				}
				else{
					break;
				}
			}
			if((right1+left1)>4||(above1+below1)>4||(skewabove1+skewbelow1)>4||(tiltedabove1+tiltedbelow1)>4){
				return true;
			}
		}
		return false;
	}

}