java 螺旋方阵_java数字螺旋方阵

把下面的源代码改成逆时针输出的importjava.util.*;publicclass作业2{publicstaticvoidmain(String[]args){intsize;Scannersc=newScanner(System.in);System.out.println("输入数组大...

把下面的源代码改成逆时针输出的

import java.util.*;

public class 作业2 {

public static void main(String[] args) {

int size;

Scanner sc = new Scanner(System.in);

System.out.println("输入数组大小:");

size = sc.nextInt();

int count = 0;

int[][] array = new int[size][size];

int m = 0, n = 0;

int down = 0, right, up, left = 0;

up = size - 1;

right = size - 1;

int max = size * size;

while (true) {

count++;

if (m == down) {

array[m][n] = count;

n++;

if (n > right) {

n = right;

m++;

}

} else if (n == right) {

array[m][n] = count;

m++;

if (m > up) {

m = up;

right--;

}

} else if (m == up) {

array[m][right] = count;

right--;

if (right < left) {

right = left;

up--;

}

} else if (right == left) {

array[up][left] = count;

up--;

if (up <= down) {

up = down;

left++;

}

} else {

down++;

up = n - 1;

right = m - 1;

m = down;

n = left;

count--;

}

/

if (count >= max) {

break;

}

} // end loop

for (int i = 0; i < size; i++) {

for (int j = 0; j < size; j++) {

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

}

System.out.println();

}

}

}

有人么有人么

展开