题目描述:
本题要求将给定的 N 个正整数按非递增的顺序,填入“螺旋矩阵”。所谓“螺旋矩阵”,是指从左上角第 1 个格子开始,按顺时针螺旋方向填充。要求矩阵的规模为 m 行 n 列,满足条件:m×n 等于 N;m≥n;且 m−n 取所有可能值中的最小值。
输入格式:
输入在第 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
具体实现:
package com.hbut.pat;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Pat_1050 {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int length = Integer.parseInt(br.readLine());
int m = 0,n = 0;
int min = 100001;
for (int i = 1; i <= Math.sqrt(length); i++) {
if (length % i == 0) {
int j = length / i;
if (min > j - i) {
m = j;
n = i;
min = m - n;
}
}
}
String[] in = br.readLine().split(" ");
int[] d = new int[length];
for (int i = 0; i < length; i++) {
d[i] = Integer.parseInt(in[i]);
}
Arrays.sort(d);
int[][] data = new int[m][n];
data[0][0] = d[length - 1];
int i = 0, j = 0;
for (int l = length - 2; l >= 0; l--) {
boolean up = false, down = false, left = false, right = false;
if (i - 1 >= 0 && data[i - 1][j] == 0)
up = true;
if (i + 1 < m && data[i + 1][j] == 0)
down = true;
if (j + 1 < n && data[i][j + 1] == 0)
right = true;
if (j - 1 >= 0 && data[i][j - 1] == 0)
left = true;
if (!up && down && !left && right) {
j = j + 1;
data[i][j] = d[l];
continue;
}
if (!up && down && !left && !right) {
i = i + 1;
data[i][j] = d[l];
continue;
}
if (!up && down && left && !right) {
i = i + 1;
data[i][j] = d[l];
continue;
}
if (!up && !down && left && !right) {
j = j - 1;
data[i][j] = d[l];
continue;
}
if (up && !down && left && !right) {
j = j - 1;
data[i][j] = d[l];
continue;
}
if (up && !down && !left && !right) {
i = i - 1;
data[i][j] = d[l];
continue;
}
if (up && !down && !left && right) {
i = i - 1;
data[i][j] = d[l];
continue;
}
if (!up && !down && !left && right) {
j = j + 1;
data[i][j] = d[l];
continue;
}
}
for (i = 0; i < m; i++) {
for (j = 0; j < n - 1; j++) {
System.out.print(data[i][j] + " ");
}
System.out.println(data[i][n - 1]);
}
}
}