nyoj 33 蛇形填数【Java】

时间限制：3000 ms | 内存限制：65535 KB
难度：3

描述

在nn方陈里填入1,2,…,nn,要求填成蛇形。例如n=4时方程为：
10 11 12 1
9 16 13 2
8 15 14 3
7 6 5 4
输入
直接输入方程的维数，即n的值。(n<=100)
输出
输出结果是蛇形方程。

样例输入

3

样例输出

7 8 1
6 9 2
5 4 3

代码

import java.util.Scanner;

public class Main {
	static int m = 1;

	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		int n = cin.nextInt();
		int[][] arr = new int[n][n];
		
		int x1 = 0;
		int y1 = n - 1;
		int x2 = n - 1;
		int y2 = 0;
		while (x1 <= x2 && y1 >= y2) {
			fun(arr, x1++, y1--, x2--, y2++);
		}

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				System.out.print(arr[i][j] + " ");
			}
			System.out.println();
		}
		cin.close();
	}

	public static void fun(int[][] arr, int x1, int y1, int x2, int y2) {
		for (int i = x1; i < x2; i++) {
			arr[i][y1] = m;
			m++;
		}
		for (int i = y1; i > y2; i--) {
			arr[x2][i] = m;
			m++;
		}
		for (int i = x2; i > x1; i--) {
			arr[i][y2] = m;
			m++;
		}
		for (int i = y2; i < y1; i++) {
			arr[x1][i] = m;
			m++;
		}
		if (x1 == x2 && y1 == y2) {
			arr[x1][y1] = m;
			m++;
		}
	}
}