回形填数与蛇形填数问题（Java）

回形填数与蛇形填数问题（Java）

import java.util.Scanner;

public class huixing {

public static void main(String[] args) {
int n;
Scanner input = new Scanner(System.in);
n = input.nextInt();
int m = n * n;
int[][] num = new int

;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
num[i][j] = 0;
}
}
int i = 0, j = 0;
int t = 1;
while (m > 0) {
while (i < n && i >= 0 && num[i][j] == 0) {
num[i][j] = m;
m --;
i += t;
}
i -= t;
j += t;
while (j >= 0 && j < n && num[i][j] == 0) {
num[i][j] = m;
m --;
j += t;
}
j -= t;
t = -t;
i += t;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
System.out.format("%-4d", num[i][j]);
}
System.out.println();
}
System.out.println();
}

}

import java.util.Scanner;

public class shexing {

public static void main(String[] args) {
int n;
Scanner input = new Scanner(System.in);
n = input.nextInt();
int[][] num = new int

;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
num[i][j] = 0;
}
}
int i = 0, j = 0;
int m = 1;
int flag = 0;
while (m <= n * n) {
//左下动
while (i >= 0 && i < n && j >= 0 && j < n && num[i][j] ==0) {
num[i][j] = m;
m ++;
i ++;
j --;
}
i --;
j ++;

if (n % 2 == 1 && i == n -1) {
flag = 1;
}
if (flag == 0) {
i ++;
}else {
j ++;
}

//右上动
while (i >= 0 && i < n && j >= 0 && j < n && num[i][j] ==0) {
num[i][j] = m;
m ++;
i --;
j ++;
}
i ++;
j --;
if (n % 2 == 0 && j == n-1) {
flag = 1;
}
if (flag == 0) {
j ++;
}else {
i ++;
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
System.out.format("%-4d", num[i][j]);
}
System.out.println();
}
System.out.println();
}

}