1 2 3 4
12 13 14 5
11 16 15 6
10 9 8 7
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
int[][] nn = new int[n][n];
int temp = n * 2;
int length = temp / 2;
int x = -1;
int y = 0;
int flag = 0;
for (int i = 0; i < n * n;) {
switch (flag) {
case 0:
x++;
break;
case 1:
y++;
break;
case 2:
x--;
break;
case 3:
y--;
break;
default:
break;
}
nn[y][x] = ++i;
length--;
if (length == 0) {
temp--;
length = temp / 2;
flag++;
flag = flag % 4;
}
}
/**
* format 指定输出数字占的宽度
* -是左对齐
* 5可以修改想要的宽度值，输入值在100以内不用修改
*/
String format = "%-5d";
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
System.out.printf(format, nn[i][j]);
}
System.out.println();
}
run：
15
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
56 57 58 59 60 61 62 63 64 65 66 67 68 69 16
55 104 105 106 107 108 109 110 111 112 113 114 115 70 17
run：
15
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
56 57 58 59 60 61 62 63 64 65 66 67 68 69 16
55 104 105 106 107 108 109 110 111 112 113 114 115 70 17
54 103 144 145 146 147 148 149 150 151 152 153 116 71 18
53 102 143 176 177 178 179 180 181 182 183 154 117 72 19
52 101 142 175 200 201 202 203 204 205 184 155 118 73 20
51 100 141 174 199 216 217 218 219 206 185 156 119 74 21
50 99 140 173 198 215 224 225 220 207 186 157 120 75 22
49 98 139 172 197 214 223 222 221 208 187 158 121 76 23
48 97 138 171 196 213 212 211 210 209 188 159 122 77 24
47 96 137 170 195 194 193 192 191 190 189 160 123 78 25
46 95 136 169 168 167 166 165 164 163 162 161 124 79 26
45 94 135 134 133 132 131 130 129 128 127 126 125 80 27
44 93 92 91 90 89 88 87 86 85 84 83 82 81 28
43 42 41 40 39 38 37 36 35 34 33 32 31 30 29
public class RoundArray {
public static int[][] createRoundArray(int n) {
int[][] roundArray = new int[n][n];
int[] add = { 1, 0 };
int size = n*n;
int x = 0;
int y = 0;
for (int i = 1; i <= size; i++) {
roundArray[x][y] = i;
int row = x + add[0];
int column = y + add[1];
if (row >= 0 && row < n && column >= 0 && column < n
&& roundArray[row][column] == 0) {
x = row;
y = column;
} else {
if (add[0] == 1) {
add[0] = 0;
add[1] = 1;
y = y + 1;
} else if (add[1] == 1) {
add[0] = -1;
add[1] = 0;
x = x - 1;
} else if (add[0] == -1) {
add[0] = 0;
add[1] = -1;
y = y - 1;
} else if (add[1] == -1) {
add[0] = 1;
add[1] = 0;
x = x + 1;
}
}
}
return roundArray;
}
public static void main(String[] args) {
int[][] array = RoundArray.createRoundArray(12);
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array[i].length; j++) {
System.out.printf("%3d",array[i][j]);
System.out.print(" ");
}
System.out.println();
}
}
result：
1 44 43 42 41 40 39 38 37 36 35 34
2 45 80 79 78 77 76 75 74 73 72 33
3 46 81 108 107 106 105 104 103 102 71 32
4 47 82 109 128 127 126 125 124 101 70 31
5 48 83 110 129 140 139 138 123 100 69 30
6 49 84 111 130 141 144 137 122 99 68 29
7 50 85 112 131 142 143 136 121 98 67 28
8 51 86 113 132 133 134 135 120 97 66 27
9 52 87 114 115 116 117 118 119 96 65 26
10 53 88 89 90 91 92 93 94 95 64 25
11 54 55 56 57 58 59 60 61 62 63 24
12 13 14 15 16 17 18 19 20 21 22 23
public class Test {
public static void main(String[] args) {
test(6);
}
public static void test(int num){
int start = - (num - 1) / 2;
int end = num / 2;
int max;
int maxNum;
for(int i = start; i <= end; i++){
for(int j = start; j <= end; j++){
max = Math.max(Math.abs(i), Math.abs(j));
maxNum = (2 * max + 1) * (2 * max + 1);
if(i == - max){
System.out.print(maxNum - max + j);
}else if(j == - max){
System.out.print(maxNum - 3*max - i);
}else if(i == max){
System.out.print(maxNum - 5*max - j);
}else{
System.out.print(maxNum - 7*max + i);
}
System.out.print("\t");
}
System.out.println();
System.out.println();
}
}
}
测试结果：
21 22 23 24 25 26
20 7 8 9 10 27
19 6 1 2 11 28
18 5 4 3 12 29
17 16 15 14 13 30
36 35 34 33 32 31
package com.csdn;
public class TestRec {
public static final int MIN = 2;
public static final int MAX = 9;
enum direction {
up, down, left, right
}
public static void main(String[] args) {
int n = 4; // 这里可以自行输入
int number, number_max;
int x, y;
int boundary_top, boundary_bottom, boundary_left, boundary_right;
int[][] matrix = new int[MAX][MAX];
direction current_direction = direction.right;
if ((n < MIN) || (n > MAX))
return;
boundary_top = 0;
boundary_bottom = n - 1;
boundary_left = 0;
boundary_right = n - 1;
x = 0;
y = 0;
number_max = n * n;
for (number = 1; number <= number_max; number++) {
matrix[x][y] = number;
switch (current_direction) {
case right:
if (++x == boundary_right) {
current_direction = direction.down;
boundary_top++;
}
break;
case down:
if (++y == boundary_bottom) {
current_direction = direction.left;
boundary_right--;
}
break;
case left:
if (--x == boundary_left) {
current_direction = direction.up;
boundary_bottom--;
}
break;
case up:
if (--y == boundary_top) {
current_direction = direction.right;
boundary_left++;
}
break;
default:
break;
}
}
for (y = 0; y < n; y++) {
for (x = 0; x < n; x++) {
System.out.printf("%5d", matrix[x][y]);
}
System.out.printf("\n");
}
}
}
1 2 3 4
12 13 14 5
11 16 15 6
10 9 8 7
