leetcode算法之面试题【29】

男娘i 2023-02-15 13:55 17阅读 0赞

### 文章目录 ###

*   *   *   *  所有题目源代码：\[Git地址\](https://github.com/ch98road/leetcode)
             *  题目
             *  方案：简单题
             *   *  复杂度计算

#### 所有题目源代码：[Git地址][Git] ####

#### 题目 ####

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。
    
     
    
    示例 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

#### 方案：简单题 ####

package cmcandy.java_language_answers;
    
    /** * Created by CHEN on 2020/6/5. */
    public class _interview_29 { 
        static class Solution { 
            public int[] spiralOrder(int[][] matrix) { 
                int i = 0;
                int j = 0;
                int row = matrix.length;
                if (row < 1) return new int[0];
                int col = matrix[0].length;
                int total = row * col;
                int[] res = new int[total];
                int index = 0;
                int cycle = 0;
                while (index < total) { 
                    for (; j < col - cycle; j++) res[index++] = matrix[i][j];
                    if (index == total) break;
                    i++;
                    j--;
                    for (; i < row - cycle; i++) res[index++] = matrix[i][j];
                    if (index == total) break;
                    j--;
                    i--;
                    for (; j >= 0 + cycle; j--) res[index++] = matrix[i][j];
                    if (index == total) break;
                    i--;
                    j++;
                    for (; i > 0 + cycle; i--) res[index++] = matrix[i][j];
                    j++;
                    i++;
                    cycle++;
                }
                return res;
            }
        }
    
        public static void main(String[] args) { 
            Solution solution = new Solution( );
            solution.spiralOrder(new int[][]{ { 1, 2, 3}, { 4, 5, 6}, { 7, 8, 9}});
            solution.spiralOrder(new int[][]{ { 1, 2, 3, 4}, { 5, 6, 7, 8}, { 9, 10, 11, 12}});
    
        }
    }

##### 复杂度计算 #####

*  时间复杂度：O()
 *  空间复杂度：O()

[Git]: https://github.com/ch98road/leetcode