蛇形矩阵

蛇形矩阵

/** * @author clydelou * */public class SnakeMatrix {/** * @param args */public static int snake(int n) {if (n <= 0) {System.out.println("error");return 0;} else {int value = 1;int i = 0, j = 0;int[][] array = new int[n][n];boolean[][] flag = new boolean[n][n];int t = n * n;while (value <= t) {if (i == 0 && j == 0) {array[i][j] = value++;flag[i][j] = true;i++;}if (j == 0 && i > 0 && i < n - 1) {if (flag[i - 1][j + 1]) {array[++i][j] = value++;flag[i][j] = true;}while (i != 0) {array[--i][++j] = value++;flag[i][j] = true;}}if (i == 0 && j > 0 && j < n - 1) {if (flag[i + 1][j - 1]) {array[i][++j] = value++;flag[i][j] = true;}while (j != 0) {array[++i][--j] = value++;flag[i][j] = true;}}if (i == n - 1 && j >= 0 && j < n - 1) {if (flag[i - 1][j + 1]) {array[i][++j] = value++;flag[i][j] = true;}while (j != n - 1) {array[--i][++j] = value++;flag[i][j] = true;}}if (j == n - 1 && i >= 0 && i < n - 1) {if (flag[i + 1][j - 1]) {array[++i][j] = value++;flag[i][j] = true;}while (i != n - 1) {array[++i][--j] = value++;flag[i][j] = true;}}}for (i = 0; i < n; i++) {for (j = 0; j < n; j++) {System.out.print(array[i][j] + "/t");}System.out.println();}return 1;}}public static void main(String[] args) {// TODO Auto-generated method stubsnake(7);}}

运行结果：

12671516283581417272949131826303910121925313840112024323741462123333642454722343543444849