蛇形矩阵代码(Java)
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int row = scan.nextInt();
int column = scan.nextInt();
int x = 0, y = 0, index = 0;
int[][] snake = new int[row][column];
int[][] flag = new int[row][column];
int[] rDir = {0, 1, 0, -1};
int[] cDir = {1, 0, -1, 0};
for (int i = 1; i <= row * column; i++) {
if ((x + rDir[index] >= row) || (y + cDir[index] >= column) ||
(x + rDir[index] < 0) || (y + cDir[index] < 0)) {
index = (index + 1) % 4;
} else if ((flag[x + rDir[index]][y + cDir[index]] > 0)) {
index = (index + 1) % 4;
}
snake[x][y] = i;
flag[x][y] = 1;
x += rDir[index];
y += cDir[index];
}
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
System.out.print(snake[i][j] + "\t");
}
System.out.println();
}
}
}
Tip One
算法中向量的使用