59. 螺旋矩阵 II

package leetcode;


public class demo_59 {
    public int[][] generateMatrix(int n) {
        int[][] array=new int[n][n];
        int width=n;
        int height=n;
        int start=0;
        int i;
        int j;
        int index=1;
        while(start<n*n) {
            i=start;
            j=start;
            for(;j<width;j++) {
                array[i][j]=index;
                index++;
            }
            j=j-1;
            for(i=i+1;i<height;i++) {
                array[i][j]=index;
                index++;
            }
            i=i-1;
            for(j=j-1;j>=start;j--) {
                array[i][j]=index;
                index++;
            }
            j=j+1;
            for(i=i-1;i>start;i--) {
                array[i][j]=index;
                index++;
            }
            start=start+1;
            height=height-1;
            width=width-1;
        }
        for(int a=0;a<n;a++) {
            for(int b=0;b<n;b++) {
                System.out.print(array[a][b]+" ");
            }
            System.out.println();
        }
        return array;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        demo_59 d59=new demo_59();
        d59.generateMatrix(3);
    }

}