LeetCode 054 Spiral Matrix

最新推荐文章于 2021-03-27 01:41:13 发布

_我们的存在

最新推荐文章于 2021-03-27 01:41:13 发布

阅读量611

点赞数 1

分类专栏： leetcode LeetCode 文章标签： leetcode matrix

本文链接：https://blog.csdn.net/yano_nankai/article/details/49967467

版权

leetcode 同时被 2 个专栏收录

208 篇文章 0 订阅

订阅专栏

LeetCode

80 篇文章 3 订阅

订阅专栏

题目描述

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

For example,
Given the following matrix:

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

You should return [1,2,3,6,9,8,7,4,5].

代码

    public static List<Integer> spiralOrder(int[][] matrix) {

        List<Integer> result = new ArrayList<Integer>();

        if (matrix == null || matrix.length == 0) {
            return result;
        }

        int startx = 0, endx = matrix.length - 1;
        int starty = 0, endy = matrix[0].length - 1;

        while (startx <= endx && starty <= endy) {

            for (int y = starty; y <= endy; y++) {
                result.add(matrix[startx][y]);
            }

            for (int x = startx + 1; x <= endx; x++) {
                result.add(matrix[x][endy]);
            }

            if (startx == endx || starty == endy) {
                break;
            }

            for (int y = endy - 1; y >= starty; y--) {
                result.add(matrix[endx][y]);
            }

            for (int x = endx - 1; x >= startx + 1; x--) {
                result.add(matrix[x][starty]);
            }

            startx++;
            starty++;
            endx--;
            endy--;
        }

        return result;
    }