LeetCode 54. Spiral Matrix（递归）

题目来源：https://leetcode.com/problems/spiral-matrix/

问题描述

54. Spiral Matrix

Medium

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

Example 1:

Input:

[

 [ 1, 2, 3 ],

 [ 4, 5, 6 ],

 [ 7, 8, 9 ]

]

Output: [1,2,3,6,9,8,7,4,5]

Example 2:

Input:

[

  [1, 2, 3, 4],

  [5, 6, 7, 8],

  [9,10,11,12]

]

Output: [1,2,3,4,8,12,11,10,9,5,6,7]

------------------------------------------------------------

题意

顺时针把矩阵的值放进一个一维数组中。

------------------------------------------------------------

思路

递归，顺时针把矩阵最外层的4个值放进数组中，然后再递归处理内层矩阵。

------------------------------------------------------------

代码

class Solution {
    private List<Integer> ans = new LinkedList<Integer>();
    
    private void dfs(int[][] matrix, int x, int y, int m, int n)
    {
        if (m == 0 || n == 0)
        {
            return;
        }
        int i = 0;
        if (m == 1)
        {
            for (i = y; i < y + n; i++)
            {
                this.ans.add(matrix[x][i]);
            }
            return;
        }
        if (n == 1)
        {
            for (i = x; i < x + m; i++)
            {
                this.ans.add(matrix[i][y]);
            }
            return;
        }
        for (i = y; i < y + n - 1; i++)
        {
            this.ans.add(matrix[x][i]);
        }
        for (i = x; i < x + m - 1; i++)
        {
            this.ans.add(matrix[i][y + n - 1]);
        }
        for (i = y + n - 1; i > y; i--)
        {
            this.ans.add(matrix[x + m - 1][i]);
        }
        for (i = x + m - 1; i > x; i--)
        {
            this.ans.add(matrix[i][y]);
        }
        dfs(matrix, x + 1, y + 1, m - 2, n - 2);
    }
    
    public List<Integer> spiralOrder(int[][] matrix) {
        int m = matrix.length;
        if (m == 0)
        {
            return Collections.emptyList();
        }
        int n = matrix[0].length;
        dfs(matrix, 0, 0, m, n);
        return this.ans;
    }
}