[算法练习及思路-leetcode剑指offer(Java解法)]No27.顺时针打印矩阵

题号:剑指 Offer 29

题目名:顺时针打印矩阵

原题URL:https://leetcode-cn.com/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/

题目描述

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

示例

示例 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

思路

1.这道题就是苦力题,没什么复杂逻辑,设计好边界,一圈一圈的去遍历就行了

解题代码

class Solution {
    public int[] spiralOrder(int[][] matrix) {
        if (matrix == null || matrix.length == 0) return new int[0];
        int row = matrix.length;
        int col = matrix[0].length;
        int[] res = new int[row * col];
        int count = 0;//记录数组编号
        int start = 0;//定义边界
        int endRow = matrix.length - 1;//定义下边界
        int endCol = matrix[0].length - 1;//定义右边界
        int end = Math.min(endRow, endCol);
        while (start <= end/* <= endRow  && start <= endCol*/) {
            int startRow = start;
            int startCol = start;
            //将第I行先加入
            while (startCol <= endCol) {
                res[count++] = matrix[startRow][startCol];
                startCol++;
            }
            //加入i行endcol列
            startCol--;
            while (startRow < endRow) {
                startRow++;
                res[count++] = matrix[startRow][startCol];
            }
            //加入endRow行endcol列
            if (start == end) break;
            while (startCol > start) {
                startCol--;
                res[count++] = matrix[startRow][startCol];
            }
            //加入i行j列

            while (startRow > start + 1) {
                startRow--;
                res[count++] = matrix[startRow][startCol];
            }
            start++;//下一个矩阵
            endRow--;
            endCol--;
            end--;
        }

        return res;

    }
}