29. 顺时针打印矩阵

NowCoder

题目描述

下图的矩阵顺时针打印结果为:1, 2, 3, 4, 8, 12, 16, 15, 14, 13, 9, 5, 6, 7, 11, 10

29. 顺时针打印矩阵 - 图1

解题思路

  1. public ArrayList<Integer> printMatrix(int[][] matrix) {
  2. ArrayList<Integer> ret = new ArrayList<>();
  3. int r1 = 0, r2 = matrix.length - 1, c1 = 0, c2 = matrix[0].length - 1;
  4. while (r1 <= r2 && c1 <= c2) {
  5. for (int i = c1; i <= c2; i++)
  6. ret.add(matrix[r1][i]);
  7. for (int i = r1 + 1; i <= r2; i++)
  8. ret.add(matrix[i][c2]);
  9. if (r1 != r2)
  10. for (int i = c2 - 1; i >= c1; i--)
  11. ret.add(matrix[r2][i]);
  12. if (c1 != c2)
  13. for (int i = r2 - 1; i > r1; i--)
  14. ret.add(matrix[i][c1]);
  15. r1++; r2--; c1++; c2--;
  16. }
  17. return ret;
  18. }

29. 顺时针打印矩阵 - 图2