【JAVA】PAT 乙级 1050 螺旋矩阵

输入格式：
输入在第 1 行中给出一个正整数 N，第 2 行给出 N 个待填充的正整数。所有数字不超过 10^​4​​ ，相邻数字以空格分隔。

输出格式：
输出螺旋矩阵。每行 n 个数字，共 m 行。相邻数字以 1 个空格分隔，行末不得有多余空格。

输入样例：
12
37 76 20 98 76 42 53 95 60 81 58 93

输出样例：
98 95 93
42 37 81
53 20 76
58 60 76

参考了柳婼的解法，将数字一层层放进二维数组
参考图解

一开始的代码只有0、5测试点通过

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		StreamTokenizer in = new StreamTokenizer(bf);
		in.nextToken();
		int N = (int) in.nval;
		int m = 0, n = 0;
		for (int i = (int) Math.sqrt(N); i >= 1; i--) {
			if (N % i == 0) {
				n = i;
				m = N / i;
				break;
			}
		}
		int[][] mar = new int[m][n];
		int[] num = new int[N];
		for (int i = 0; i < num.length; i++) {
			in.nextToken();
			num[i] = (int) in.nval;
		}
		Arrays.sort(num);
		int rols = 0, cols = 0;
		int role = m - 1, cole = n - 1;
		int index = N - 1;
		while (index >= 0) {
			for (int i = cols; i <= cole; i++) {
				mar[rols][i] = num[index--];
			}
			for (int i = rols + 1; i < role; i++) {
				mar[i][cole] = num[index--];
			}
			for (int i = cole; i >= cols; i--) {
				mar[role][i] = num[index--];
			}
			for (int i = role - 1; i > rols; i--) {
				mar[i][cols] = num[index--];
			}
			rols++;
			cols++;
			role--;
			cole--;
		}
		for (int i = 0; i < mar.length; i++) {
			for (int j = 0; j < mar[i].length; j++) {
				if (j == 0) {
					out.print(mar[i][j]);
				} else {
					out.print(" " + mar[i][j]);
				}
			}
			out.println();
		}
		out.flush();
	}
}

在控制台测试了一下质数个数的元素，结果报错，所以加上了如果n==1，直接一行一个输出

	if (n == 1) {
		for (int i = num.length - 1; i >= 0; i--) {
			out.println(num[i]);
		}
	}

然后测试点1、2过不去，6、7超时，后来试了一下27个元素，会报错，原因是index超出了数组的范围，所以要在每个循环前加一个判断index是否小于0。

	if (index < 0) {
		break;
	}

然后居然AC了，最后两个测试点也不超时了？？？
不过其实是压线过的，我测试多次提交试了试，有时能过有时不能过

题目的时间要求是200ms，结果199ms

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		StreamTokenizer in = new StreamTokenizer(bf);
		in.nextToken();
		int N = (int) in.nval;
		int m = 0, n = 0;
		for (int i = (int) Math.sqrt(N); i >= 1; i--) {
			if (N % i == 0) {
				n = i;
				m = N / i;
				break;
			}
		}
		int[][] mar = new int[m][n];
		int[] num = new int[N];
		for (int i = 0; i < num.length; i++) {
			in.nextToken();
			num[i] = (int) in.nval;
		}
		Arrays.sort(num);
		if (n == 1) {
			for (int i = num.length - 1; i >= 0; i--) {
				out.println(num[i]);
			}
		} else {
			int rols = 0, cols = 0;
			int role = m - 1, cole = n - 1;
			int index = N - 1;
			while (index >= 0) {

				for (int i = cols; i <= cole; i++) {
					if (index < 0) {
						break;
					}
					mar[rols][i] = num[index--];

				}
				for (int i = rols + 1; i < role; i++) {
					if (index < 0) {
						break;
					}
					mar[i][cole] = num[index--];
				}
				for (int i = cole; i >= cols; i--) {
					if (index < 0) {
						break;
					}
					mar[role][i] = num[index--];
				}
				for (int i = role - 1; i > rols; i--) {
					if (index < 0) {
						break;
					}
					mar[i][cols] = num[index--];
				}
				rols++;
				cols++;
				role--;
				cole--;
			}
			for (int i = 0; i < mar.length; i++) {
				for (int j = 0; j < mar[i].length; j++) {
					if (j == 0) {
						out.print(mar[i][j]);
					} else {
						out.print(" " + mar[i][j]);
					}
				}
				out.println();
			}
		}
		out.flush();
	}
}