逆序输出回形数组

             课上老师随意提了一下，有位师兄与一份不错的工作失之交臂，就是因为没有写出回形数组的题目，好吧，我立马上心了。而且觉得题目蛮有趣的，初学数组的我对此很感兴趣。刚开始的思路是想给二维数组的最外环赋值，然后再一层一层递进，后来发觉这样很繁琐。后来在草稿纸上画了几次，突然茅塞顿开，找到了数组下标的规律，很快就做出来了，蛮开心的~

 

package norah.javase.exer;

//2015-09-19

import java.util.Scanner;

 

public classZigZag3 {

 

    public static void main(String[] args) {

       System.out.println("请输入回形数组的行列数：");

       Scannerscanner= new Scanner(System.in);

       int n = scanner.nextInt();

 

       ZigZag(n);

    }

 

    public static void ZigZag(int n) {

       int[][] zigzag1 = new int[n][n];

 

       intnum = 1;

       intlineplus = 0;

       introwplus = 0; // 记录递增的列数

       intlinedecrease = n - 1; // 记录递减的行数

       introwdecrease = n - 1; // 记录递减的列数

 

       for (intk = 0; k < Math.round(n/2); k++) {

 

           for (intj = rowplus; j < rowdecrease; j++) {

              zigzag1[lineplus][j] = num++;

           }

           for (inti = lineplus; i < linedecrease; i++) {

              zigzag1[i][rowdecrease] = num++;

           }

           for (intj = rowdecrease; j > rowplus; j--) {

               zigzag1[linedecrease][j] = num++;

           }

           for (inti = linedecrease; i > lineplus; i--) {

              zigzag1[i][lineplus] = num++;

           }

 

           lineplus++;

           rowplus++;

           linedecrease--;

           rowdecrease--;

          

           if(lineplus == rowdecrease){

              zigzag1[lineplus][rowdecrease] = n*n;

           }

       }

 

       for (inti = 0; i < n; i++) {

           for (intj = 0; j < n; j++) {

              System.out.print(zigzag1[i][j] + "\t");

           }

           System.out.println();

       }

    }

}