1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
| import java.io.*; public class RingDemo { public static void main(String args[]){ String strln = ""; System.out.println("请输入矩阵的列数"); InputStreamReader input = new InputStreamReader(System.in); BufferedReader buff = new BufferedReader(input); try{ strln = buff.readLine(); }catch(IOException e){ System.out.println(e.toString()); } int int1 = Integer.parseInt(strln); int n = int1; System.out.println("这是行列数为"+n+"的螺旋型数组"); int intA = 1; int[][] array = new int[n][n]; int intB; if(n%2 == 0){ intB = n / 2; }else{ intB = n/2 + 1; } for(int i=0;i<=intB;i++){ for(int j=i;j<n-i;j++){ array[i][j] = intA; intA++; } for(int k = i;k<n-i;k++){ array[k][n -i - 1] = intA; intA++; } for(int l = n-i-2;l>=i;l--){ array[n -i -1][l] = intA; intA++; } for(int m = n-i-2;m > i;m--){ array[m][i] = intA; intA++; } } for(int i=0;i<n;i++){ for(int j = 0;j<n;j++){ System.out.print(array[i][j]+"\t"); } System.out.println(); } } }
|