求蛇形矩阵

蛇形矩阵：输入一个数n，输出对应的矩阵，比如

n=3，则矩阵为：

1  2  3

8  9  4

7  6  5

代码如下：

package test.com;
import java.util.Scanner;
public class SnakeMatrix 
{	
	public static void main(String[] args)
	{
		int k=0;
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt(); 		//首先输入矩阵的维数
		int a[][] = new int[n][n];  //存储所有元素的二维数组 
		int count = 1; 				//计数器，每走一步加一
		//把二维数组从外到内一层一层剥开，按照上、右、下、左的顺序走
		// 注意临界值条件,尤其是拐角别重叠覆盖
		if(n%2==0)
			k=n/2;
		else
			k=(n+1)/2; //绕k圈赋值
		for (int i = 0; i < k/2+1; i++) 
		{
			//up
			for (int j = i; j < n-i; j++) 
			{
				a[i][j]= count++;
			}
			print(n, a);
			//right
			for (int j = i+1; j < n-i; j++) 
			{
				a[j][n-i-1]= count++;
			}
			print(n, a);
			//down
			for (int j = n-i-2; j >=i; j--) 
			{
				a[n-i-1][j]= count++;
			}
			print(n, a);
			//left
			for (int j = n-i-2; j >i; j--)
			{
				a[j][i]= count++;
			}
			print(n, a);
		}
		print(n, a);
	}
	public static void print(int n,int[][] a)
	{
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++) 
			{
				System.out.print(a[i][j]+"\t");
			}
			System.out.println();
		}
		System.out.println();
	}
}

结果如下：

3
1 2 3
0 0 0
0 0 0


1 2 3
0 0 4
0 0 5


1 2 3
0 0 4
7 6 5


1 2 3
8 0 4
7 6 5


1 2 3
8 9 4
7 6 5


1 2 3
8 9 4
7 6 5


1 2 3
8 9 4
7 6 5


1 2 3
8 9 4
7 6 5


1 2 3
8 9 4
7 6 5