LeetCode Spiral Matrix II (生成螺旋矩阵)

最新推荐文章于 2022-05-10 14:12:22 发布

原创最新推荐文章于 2022-05-10 14:12:22 发布 · 671 阅读

0 ·

CC 4.0 BY-SA版权

OJ 专栏收录该内容

986 篇文章

订阅专栏

本文介绍了一种生成螺旋矩阵的方法，通过类似LeetCode螺旋矩阵题目的逆过程实现。文章提供了一个Java解决方案，详细展示了如何填充一个n×n的矩阵，使其按螺旋顺序包含从1到n²的整数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an integer n, generate a square matrix filled with elements from 1 to n² in spiral order.

For example,
Given n = 3,

You should return the following matrix:

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

题意：给出矩阵的维数，将1-n^2的数填入螺旋矩阵中

思路：与LeetCode Spiral Matrix(螺旋矩阵)方法类似，只是一个逆过程而已

代码如下

public class Solution {
    public int[][] generateMatrix(int n) {
        int[][] matrix = new int[n][n];

        int[][] dir = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

        boolean[][] vis = new boolean[n][n];

        int cnt = 0;
        int total = n * n;
        int cur = 0;
        int x = 0, y = 0;
        int nextx = 0, nexty = 0;

        while (cnt < total)
        {
            if (!vis[x][y])
            {
                matrix[x][y] = cnt + 1;
                vis[x][y] = true;
                cnt++;
            }

            nextx = x + dir[cur][0]; nexty = y + dir[cur][1];

            if (nextx < 0 || nextx >= n || nexty < 0 || nexty >= n || vis[nextx][nexty] == true)
            {
                cur = (cur + 1) % 4;
                continue;
            }

            x = nextx; y = nexty;
        }

        return matrix;
    }
}