牛客堂常见面试题精讲（一）2

转圈打印矩阵的算法思想：

package com.zhao.niuke;

public class Problem_01_PrintMatrixSpiralOrder {
	public static void spiralOrderPrint(int[][] 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(int[][] 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 (curC != dC) {
				System.out.print(m[tR][curC] + " ");
				curC++;
			}
			while (curR != dR) {
				System.out.print(m[curR][dC] + " ");
				curR++;
			}
			while (curC != tC) {
				System.out.print(m[dR][curC] + " ");
				curC--;
			}
			while (curR != tR) {
				System.out.print(m[curR][tC] + " ");
				curR--;
			}
		}
	}
	public static void main(String[] args) {
		int[][] matrix = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 },
				{ 13, 14, 15, 16 } };
		spiralOrderPrint(matrix);//转圈打印矩阵开始
	}
}
/*
 * 如何实现转圈打印矩阵
 * 思路就是找准坐标移动，先从左上角第一个坐标移动打印开始
 * 1 2 3 4
 * 5 6 7 8 
 * 9 10 11 12
 * 13 14 15 16
 */

详细讲解如图所示：