幻方程序

利用二维数组和不同幻方的走位规律，自制出的全能幻方源码

//幻方是一种将数字安排在正方形格子中，使每行、列和对角线上的数字和都相等的方法。
import java.util.Scanner;
import java.util.InputMismatchException;

public class MagicSquare {
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		while(true){
			System.out.println("请输入幻方阶数  3-100,停止请输入任意字母");
			int n = 0;	
			try{
				n = in.nextInt();		
			}catch (InputMismatchException e){	//当输入的数字不是整数时,接受到输入错配异常InputMismatchException
				System.out.println("程序结束");
				break;							//用户输入错误,停止程序
			}
			if (n < 3) {
				System.out.println("您输入的数据小于三,输入错误,请重新输入") ;
				continue;
			}
			int[][] hfArr = new int[n][n];
			if (n > 100) {
				System.out.println("数据输入太大,运算无意义");
			} else if (n % 2 != 0) {
				mo_1(n,hfArr);
				printArr(hfArr);
				judeg(hfArr);		//judeg()用于判断输出的幻方是否正确,可以不选
			} else if (n % 4 == 0) {
				mu_4(n,hfArr);
				printArr(hfArr);
				judeg(hfArr);
			} else {
				mu_2(n,hfArr);
				printArr(hfArr);
				judeg(hfArr);
			}
		}			
	}

	public static void mu_4(int n,int[][] arr) {		//用于计算4m=n阶幻方(4的倍数阶)
		int i = 0, j, c1 = 1, c2 = n * n;
		while (i < n) {
			j = 0;
			while (j < n) {
				arr[i][j] = -1;
				arr[i + 1][j + 1] = -1;
				arr[i + 2][j + 2] = -1;
				arr[i + 3][j + 3] = -1;
				arr[i][j + 3] = -1;
				arr[i + 1][j + 2] = -1;
				arr[i + 2][j + 1] = -1;
				arr[i + 3][j] = -1;
				j += 4;
			}
			i += 4;
		}
		for (int a = 0; a < n; a++) {
			for (int b = 0; b < n; b++) {
				if (arr[a][b] == 0) {
					arr[a][b] = c1;
				} else {
					arr[a][b] = c2;
				}
				c1++;
				c2--;
			}
		}
	}

	public static void mu_2(int n,int[][] arr) {		//用于计算4m+2=n阶幻方(n不是4的倍数,但是n是偶数)
		int xiaoArr[][] = new int[n/2][n/2];
		mo_1(n / 2,xiaoArr);
		int k = (n - 2) / 4;
		for (int a = 0; a < n; a++) {
			for (int b = 0; b < n; b++) {
				if (a < n / 2 && b < n / 2) {
					arr[a][b] = xiaoArr[a][b];
					if (a != k && b < k) {
						arr[a][b] += (n * n) / 4 * 3;
					}
					if (a == k && (k > b - a && b - a >= 0)) {
						arr[a][b] += (n * n) / 4 * 3;
					}
				} else if (a < n / 2 && b >= n / 2) {
					arr[a][b] = xiaoArr[a][b - n / 2] + (n * n) / 2;
					if (b < n / 2 + 1 + k && b > n / 2 + 1) {
						arr[a][b] -= (n * n) / 4;
					}
				} else if (a >= n / 2 && b >= n / 2) {
					arr[a][b] = xiaoArr[a - n / 2][b - n / 2] + (n * n) / 4;
					if (b < n / 2 + 1 + k && b > n / 2 + 1) {
						arr[a][b] += (n * n) / 4;
					}
				} else {
					arr[a][b] = xiaoArr[a - n / 2][b] + (n * n) / 4 * 3;
					if (a != k + n / 2 && b < k) {
						arr[a][b] -= (n * n) / 4 * 3;
					}
					if (a == k + n / 2
							&& (k > b + n / 2 - a && b + n / 2 - a >= 0)) {
						arr[a][b] -= (n * n) / 4 * 3;
					}
				}
			}
		}
	}

	public static void mo_1(int n, int[][] hfsz) {		//用于计算2m+1=n阶幻方(n为奇数)

		int x = 0, y = n / 2;  //x和y记录幻方数组的两个角标,用于给数组两个角标赋值
		int E = 1;				//E记录幻方数组中x角标中y角标的值
		int x1 = 0, y1 = 0;		//x1和y1作为试验数,测试数组的角标是否越位和该数组的角标上是否有值
		hfsz[x][y] = 1;
		E = E + 1;
		while (E <= n * n) {
			x1 = x - 1;
			y1 = y - 1;
			if (x1 == -1) {
				x1 = x1 + n;
			}
			if (y1 == -1) {
				y1 = y1 + n;
			}
			if (hfsz[x1][y1] != 0) {
				x++;
			} else {
				x = x1;
				y = y1;
			}
			hfsz[x][y] = E;
			E++;
		}
	}

	public static void printArr(int arr[][]){			//用于遍历打印二维数组
		int n = arr.length;	
		for (int a = 0; a < n; a++) {
			System.out.print("  ");
			for (int b = 0; b < n; b++) {
				if (arr[a][b] < 10) 
					System.out.print(arr[a][b]+"    ");
				else if (arr[a][b] < 100)
					System.out.print(arr[a][b]+"   ");
				else if (arr[a][b] < 1000) 
					System.out.print(arr[a][b]+"  ");
				else 
					System.out.print(arr[a][b]+" ");
			}
			System.out.print("\n\n");
		}
	}

	public static void judeg(int arr[][]) {		// 用于判断幻方知否正确
		int leftBias = 0;
		int rightBias = 0;
		for (int a = 0; a < arr.length; a++) {
			int z1 = 0;
			int z2 = 0;
			for (int b = 0; b < arr.length; b++) {
				z1 += arr[a][b];
				z2 += arr[b][a];
				if(a == b)
					leftBias += arr[a][b];
				if((a+b) == (arr.length - 1))
					rightBias += arr[a][b];
				
			}
			System.out.println("\t第" + (a + 1) + "行的值是: " + z1 + "\n");
			System.out.println("\t第" + (a + 1) + "列的值是: " + z2 + "\n");
		}
		System.out.println("\t左斜边的值是: " + leftBias + "\n");
		System.out.println("\t右斜边的值是: " + rightBias + "\n");
	}
}