LeetCode 53 Spiral Matrix

最新推荐文章于 2025-12-21 21:47:42 发布

原创最新推荐文章于 2025-12-21 21:47:42 发布 · 555 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #leetcode

leetcode 专栏收录该内容

120 篇文章

订阅专栏

本文介绍了一种矩阵螺旋遍历算法的实现方法，通过设定四个边界变量来控制遍历过程，确保不会越界。该算法适用于任何m x n大小的矩阵，并能按螺旋顺序返回所有元素。

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 class Solution {
	public List<Integer> spiralOrder(int[][] matrix) {
		ArrayList<Integer> al = new ArrayList<Integer>();
		if (matrix.length == 0)
			return al;
		int x1 = 0;
		int y1 = 0;
		int x2 = matrix.length - 1;
		int y2 = matrix[0].length - 1;
		while (x1 <= x2 && y1 <= y2) {
			// up row
			for (int i = y1; i <= y2; ++i)
				al.add(matrix[x1][i]);
			// right column
			for (int i = x1 + 1; i <= x2; ++i)
				al.add(matrix[i][y2]);
			// bottom row
			for (int i = y2 - 1; x2 != x1&& i >= y1; --i)
				al.add(matrix[x2][i]);
			// left column
			for (int i = x2 - 1; y1 != y2 && i > x1; --i)
				al.add(matrix[i][y1]);

			x1++;
			y1++;
			x2--;
			y2--;
		}

		return al;
	}
}