Java算法：旋转打印1至n方的整数数组？简洁实现

import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Scanner;
public class 顺时针旋转打印1至n方数组 {
    //1.n*n 顺时针旋转输出 1至n^2 的数组
    public static void main(String[] args) {
        Integer n=10;
        //Scanner d=new Scanner(System.in);
        //n=d.nextInt();
        int [][]array1=new int[n+1][n+1];
        solve(n,array1);
        print(n,array1);
        System.out.print(array1.length+" "+array1[0].length);
        Integer d=3/2;
        System.out.print("\n"+d);
    }
    private static void print(int n,int[][]array1){
        for(int i=0;i<=n;i++){
            for(int j=0;j<=n;j++){
                System.out.print(array1[i][j]+" ");
            }
            System.out.print("\n");
        }
    }
    private static void solve(int n,int[][]a){
        Integer t=1;
        for(int i=1;i<=(n+1)/2;i++) {
            for (int j = i; j <= n - i + 1; j++) a[i][j] = t++;  //右行
            for (int j = i+1; j <= n - i + 1; j++) a[j][n - i + 1] = t++;    //下行
            for (int j = n - i; j >= i; j--) a[n - i + 1][j] = t++;    //左行
            for (int j = n - i; j >= i+1; j--) a[j][i] = t++; //上行
        }
    }
}