【数组】之宇宙无敌360度反复横跳之旋转打印数组

算法上没有难度，需要注意逻辑问题设计。
思路：

• 最容易理解的方法是层层剥开，一圈一圈打印
• 左上角来两个指针横纵坐标，右下角也是
• 写一个方法用来打印圈
• 当左上角和右下角撞见了，停止

打印圈：

			int curR = r1;//左上角横坐标
			int curC = c1;//左上角纵坐标
			while (curC != c2) {//从左到右
				System.out.print(matrix[curR][curC] + " ");
				curC++;
			}//到头了
			while (curR != r2) {//从上到下
				System.out.print(matrix[curR][curC] + " ");
				curR++;
			}//到了
			while (curC != c1) {//从右到左
				System.out.print(matrix[curR][curC] + " ");
				curC--;
			}
			while (curR != r1) {//从下到上
				System.out.print(matrix[curR][curC] + " ");
				curR--;
			}

需要考虑如果只有一行或者一列的情况

		if (r1 == r2) {
			for (int i = c1; i <= c2; i++) {
				System.out.print(matrix[r1][i] + " ");
			}
		} else if (c1 == c2) {
			for (int i = r1; i <= r2; i++) {
				System.out.print(matrix[i][c1] + " ");
			}
		}

完整代码：

/*
 * 旋转打印数组*/
public class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String[] numStrings = in.readLine().split(" ");
		int n = Integer.valueOf(numStrings[0]);
		int m = Integer.valueOf(numStrings[1]);
		int[][] matrix = new int[n][m];
		for (int i = 0; i < n; i++) {
			String[] lineStrings = in.readLine().split(" ");
			for (int j = 0; j < m; j++) {
				matrix[i][j] = Integer.valueOf(lineStrings[j]);
			}
		}
		spiralOrderPrint(matrix);

	}

	public static void spiralOrderPrint(int[][] matrix) {
	
        if (matrix==null||matrix.length==0||matrix[0]==null||matrix[0].length==0) {
			return;
		}
		int r1 = 0, c1 = 0;
		int r2 = matrix.length - 1, c2 = matrix[0].length - 1;
		while (r1 <= r2 && c1 <= c2) {
			printEdge(matrix, r1++, c1++, r2--, c2--);
		}

	}

	private static void printEdge(int[][] matrix, int r1, int c1, int r2, int c2) {
		if (r1 == r2) {
			for (int i = c1; i <= c2; i++) {
				System.out.print(matrix[r1][i] + " ");
			}
		} else if (c1 == c2) {
			for (int i = r1; i <= r2; i++) {
				System.out.print(matrix[i][c1] + " ");
			}
		} else {
			int curR = r1;
			int curC = c1;
			while (curC != c2) {
				System.out.print(matrix[curR][curC] + " ");
				curC++;
			}
			while (curR != r2) {
				System.out.print(matrix[curR][curC] + " ");
				curR++;
			}
			while (curC != c1) {
				System.out.print(matrix[curR][curC] + " ");
				curC--;
			}
			while (curR != r1) {
				System.out.print(matrix[curR][curC] + " ");
				curR--;
			}

		}
	}
}