java/204754.html">java;">import java.util.Scanner;public class mysnakematrix {	private int n;	//	private int a[][];	// 聲明一個矩陣	private int value = 1;	// 矩陣里數字的值	public mysnakematrix(int i) {		this.n = i;		a = new int[n][n];	}	// 計算第m層左上角的數字	private int getcorner(int m) {		int corner = 1;		int o = n - 1;		for (int i = 0; i < m - 1; ++i) {			corner += 4 * o;			o = o - 2;		}		return corner;	}	// 生成矩陣的每一層的每一邊的數	// s表示4個方向，分別取值1,2,3,4，表示4個不同的方向。	// o表示這條邊的起始值。	// x表示第m層每條邊的數字個數	private void side(int s, int o, int x, int m) {		int i = 0;		int j = 0;		switch (s) {			case 1:			      i = m - 1;			j = m - 1;			for (int k = 0; k < x; ++k) {				a[i][j + k] = value;				++value;			}			break;			case 2:			      i = m - 1;			j = m - 1 + x;			for (int k = 0; k < x; ++k) {				a[i + k][j] = value;				++value;			}			break;			case 3:			      i = m - 1 + x;			j = m - 1 + x;			for (int k = 0; k < x; ++k) {				a[i][j - k] = value;				++value;			}			break;			case 4:			      i = m - 1 + x;			j = m - 1;			for (int k = 0; k < x; ++k) {				a[i - k][j] = value;				++value;			}			break;		}	}	// 生成蛇形矩陣的第m層	private void shell(int m)// m表示第m層	{		int x = n - 1 - (m - 1) * 2;		// x表示第m層每條邊的數字個數		int o = getcorner(m);		int o1 = o;		int o2 = o1 + x;		int o3 = o2 + x;		int o4 = o3 + x;		// System.out.println(o4);		side(1, o, x, m);		side(2, o, x, m);		side(3, o, x, m);		side(4, o, x, m);	}	// 生成蛇形矩陣	public void snakeMatrix() {		int m = (n + 1) / 2;		// 計算一共有多少層		for (int i = 1; i <= m; ++i) {			shell(i);		}		if (n % 2 == 1) {			a[n / 2][n / 2] = n * n;		}	}	// 打印矩陣	public void print() {		for (int i = 0; i < n; ++i) {			for (int j = 0; j < n; ++j) {				if (a[i][j] < 10) {					System.out.print(a[i][j] + " ");				} else {					System.out.print(a[i][j] + " ");				}			}			System.out.println();		}	}	public static void main(String args[]) {		mysnakematrix my = new mysnakematrix(new Scanner(System.in).nextint());		//利用Scanner獲取控制臺輸入		my.snakeMatrix();		my.print();	}}