《LeetCode力扣练习》剑指 Offer 29. 顺时针打印矩阵 Java

《LeetCode力扣练习》剑指 Offer 29. 顺时针打印矩阵 Java

---

---

一、资源

• 题目：

  输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。

  示例 1：

  输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
  输出：[1,2,3,6,9,8,7,4,5]

  示例 2：

  输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
  输出：[1,2,3,4,8,12,11,10,9,5,6,7]

  限制：

  0 <= matrix.length <= 100
  0 <= matrix[i].length <= 100
  

  注意：本题与主站 54 题相同：https://leetcode-cn.com/problems/spiral-matrix/

  来源：力扣（LeetCode）
  链接：https://leetcode-cn.com/problems/shun-shi-zhen-da-yin-ju-zhen-lcof
  著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

• 上代码（经过线上OJ测试）

  import java.util.HashMap;
  
  /**
   * Created with IntelliJ IDEA.
   *
   * @author : DuZhenYang
   * @version : 2022.03.01  18:01:48
   * description :
   */
  public class LeetCode {
      public int[] spiralOrder(int[][] matrix) {
          if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
              return new int[0];
          }
  
          int[][] go = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
          HashMap<Integer, int[]> direction = new HashMap<>();
          direction.put(0, go[0]);
          direction.put(1, go[1]);
          direction.put(2, go[2]);
          direction.put(3, go[3]);
  
          int m = matrix.length;
          int n = matrix[0].length;
          int total = m * n;
          boolean[][] visited = new boolean[m][n];
          int[] result = new int[total];
          int row = 0;
          int col = 0;
          int newDirection = 0;
  
          for (int i = 0; i < total; i++) {
  
              result[i] = matrix[row][col];
              visited[row][col] = true;
              int newRow = row + direction.get(newDirection % 4)[0];
              int newCol = col + direction.get(newDirection % 4)[1];
  
              if (newRow == m || newCol == n || newRow < 0 || newCol < 0 || visited[newRow][newCol]) {
                  newDirection++;
                  newRow = row + direction.get(newDirection % 4)[0];
                  newCol = col + direction.get(newDirection % 4)[1];
              }
              row = newRow;
              col = newCol;
          }
  
          return result;
      }
  }