distanceonchessboard.java

PKU中一些数据结构基本算法题的java实现

import java.util.Scanner;


/**
 * ID:1657
 * @author yhm
 *
 */
public class DistanceonChessboard {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		int caseNum = cin.nextInt();
		for(int i=0;i<caseNum;i++){
			String str = cin.next();
			String str1 = cin.next();			
			
			int n1=0,n2=0,n3=0,n4=0,flag=0;

			int dist1 = Math.abs(str.charAt(0)-str1.charAt(0));
			int dist2 = Math.abs(str.charAt(1)-str1.charAt(1));
			
			if(dist1==0&&dist2==0)
				n1=n2=n3=n4=0;
			else if(dist1==dist2){
					n1=dist1;
					n2=1;
					n3=2;
					n4=1;
				}
			else if(dist1==0&&dist2%2!=0){
				n1=dist2;
				n2=1;
				n3=1;
				flag=1;
			}
			else if(dist1==0&&dist2%2==0){
				n1=dist2;
				n2=1;
				n3=1;
				n4=2;;
			}
			else if(dist2==0&&dist1%2!=0){
				n1=dist2;
				n2=1;
				n3=1;
				flag=1;
			}
			else if(dist2==0&&dist1==0){
				n1=dist2;
				n2=1;
				n3=1;
				n4=2;
			}
			else if((dist1%2==0&&dist2%2==0)||(dist1%2!=0&&dist2%2!=0)){
				n1=Math.max(dist1,dist2);
				n2=2;
				n3=2;
				n4=2;
			}
			
			if(flag!=1){
				System.out.println(n1+" "+n2+" "+n3+" "+n4);
			}
			else{
				System.out.println(n1+" "+n2+" "+n3+" "+"Inf");
			}

		}
	}

}