用java写有着意思的玩意，你会吗,该怎么解决

用java写有着意思的玩意，你会吗
1 2 3 4 5
16 17 18 19 6
15 24 25 20 7
14 23 22 21 8
13 12 11 10 9
有人会吗

[解决办法]
以前见过，没做出来，今天灵感来了，太神奇了，呵呵

Java code

    public static void main(String[] args) {        int m = 6;/*行*/        int n = 6;/*列*/        int[][] pos = new int[m][n];/*位置*/        /**         * 位置结构如下：         * [0][0],[0][1],[0][2],[0][3],[0][4]         *          * [1][0],[1][1],[1][2],[1][3],[1][4]         *          * [2][0],[2][1],[2][2],[2][3],[2][4]         *          * [3][0],[3][1],[3][2],[3][3],[3][4]         *          * [4][0],[4][1],[4][2],[4][3],[4][4]         */        int count = 0;        int r = 0, c = 0;/*r:行下标    l:列下标    pos[r][l]对应以上位置*/        /*赋值方向，先向右c++，再向下r++，再向左c--，再向上r--*/        final int up = 1;        final int  down = -1;        final int left = 2;        final int right = -2;        int dir = right;/*开始方向*/        int cir = 1;/* 第几圈赋值 */        while(true){            count++;            pos[r][c]=count;/*赋值*/            switch(dir){                case right:                    if(c<n-cir){/*当前行右方还有没赋值的*/                        c++;                    }else{                        dir = down;                        r++;                    }                    break;                case down:                    if(r<m-cir){/*当前列下方还有没赋值的*/                        r++;                    }else{                        dir = left;                        c--;                    }                    break;                case left:                    if(c>cir-1){/*当前行左边还有没赋值的*/                        c--;                    }else{                        dir = up;                        r--;                    }                    break;                case up:                    if(r>cir){/*当前列上边边还有没赋值的*/                        r--;                    }else{                        cir++;/*赋值了一圈*/                        dir = right;                        c++;                    }                    break;            }            if(count>=m*n){                break;            }        }        /*输出回数*/        for(int i = 0; i<m; i++){            for(int j = 0; j<n; j++){                if(pos[i][j]<10){                    System.out.print(pos[i][j]+" "+" ");                }else{                    System.out.print(pos[i][j]+" ");                }            }            System.out.println();        }    }
[解决办法]
Java code
public class SpiralMatrix {    public final static int DOWN_FIRST = 0;    public final static int RIGHT_FIRST = 1;    public static void main(String[] args) {        int[][] spiralMatrix = spiralMatrix(5, RIGHT_FIRST);        output(spiralMatrix);    }        public static int[][] spiralMatrix(final int side, final int direction) {        int[][] matrix = new int[side][side];        int[] rc = { 0, 0 };        int c = 0, n = 1, t = (side << 1) - 1;        while(c < t) {            int p = (c + 1) >> 1;            while(p++ < side) {                matrix[rc[0]][rc[1]] = n++;                if(p == side) {                    c++;                }                rc[(c & 1) ^ direction] += 1 - (c & 2);            }        }        return matrix;    }    private static void output(int[][] matrix) {        for(int i = 0; i < matrix.length; i++) {            for(int j = 0; j < matrix[i].length; j++) {                if(j > 0) {                    System.out.print(' ');                }                System.out.printf("%2d", matrix[i][j]);            }            System.out.println();        }    }}