黑马程序员技术交流社区
标题:
定义一个等长的二维数组 如何将这个数组螺旋输出
[打印本页]
作者:
YMW
时间:
2016-6-11 23:06
标题:
定义一个等长的二维数组 如何将这个数组螺旋输出
意思就是定义一个二维数组,将这个数组遍历出来,然后出来的样子事首尾相连,感觉好难,目前我跟我同学都还没思路,哪位路过的大神能指点下,感激不尽!!
作者:
ancheng
时间:
2016-6-11 23:54
是不是一圈一圈的打印
作者:
ancheng
时间:
2016-6-11 23:55
import java.util.Scanner;
public class 回形取数 {
private static Scanner sc;
public static void main(String[] args) {
sc = new Scanner(System.in);
String[] str1 = sc.nextLine().split(" ");
int x = Integer.parseInt(str1[0]);
int y = Integer.parseInt(str1[1]);
String[][] arr = new String[x][y];
for (int i = 0; i < x; i++) {
String[] str = sc.nextLine().trim().split(" ");
arr[i] =str;
}
spiralOrderPrint(arr);
}
public static void spiralOrderPrint(String[][] matrix) {
int tR = 0;
int tC = 0;
int dR = matrix.length - 1;
int dC = matrix[0].length - 1;
while (tR <= dR && tC <= dC) {
printEdge(matrix, tR++, tC++, dR--, dC--);
}
}
public static void printEdge(String[][] m, int tR, int tC, int dR, int dC) {
if (tR == dR) {
for (int i = tC; i <= dC; i++) {
System.out.print(m[tR][i] + " ");
}
} else if (tC == dC) {
for (int i = tR; i <= dR; i++) {
System.out.print(m[i][tC] + " ");
}
} else {
int curC = tC;
int curR = tR;
while (curR != dR) {
System.out.print(m[curR][tC] + " ");
curR++;
}
while (curC != dC) {
System.out.print(m[dR][curC] + " ");
curC++;
}
while (curR != tR) {
System.out.print(m[curR][dC] + " ");
curR--;
}
while (curC != tC) {
System.out.print(m[tR][curC] + " ");
curC--;
}
}
}
}
复制代码
作者:
ancheng
时间:
2016-6-11 23:56
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int m = sc.nextInt();
int n = sc.nextInt();
int[][] arr = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
arr[i][j] = sc.nextInt();
}
}
sc.close();
spiralOrderPrint(arr);
}
public static void spiralOrderPrint(int[][] m) {
int r = 0;
int c = 0;
int tR = 0;
int tC = 0;
int dR = m.length - 1;
int dC = m[0].length - 1;
int n = m.length * m[0].length;
for (int count = 0; count < n; tR++, tC++, dR--, dC--) {
while (r < dR && count <= n) {
System.out.print(m[r++][c] + " ");
count++;
}
while (c < dC && count < n) {
System.out.print(m[r][c++] + " ");
count++;
}
while (r > tR && count < n) {
System.out.print(m[r--][c] + " ");
count++;
}
while (c > tC && count < n) {
System.out.print(m[r][c--] + " ");
count++;
}
c++;
r++;
}
}
}
复制代码
欢迎光临 黑马程序员技术交流社区 (http://bbs.itheima.com/)
黑马程序员IT技术论坛 X3.2