#yyds干货盘点# LeetCode 腾讯精选练习 50 题：螺旋矩阵 II

Posted 2022-10-29

题目：

给你一个正整数 n ，生成一个包含 1 到 n2 所有元素，且元素按顺时针顺序螺旋排列的 n x n 正方形矩阵 matrix 。

 

示例 1：

输入：n = 3

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

示例 2：

输入：n = 1

输出：[[1]]

代码实现：

class Solution 
    public int[][] generateMatrix(int n) 
        int num = 1;
        int[][] matrix = new int[n][n];
        int left = 0, right = n - 1, top = 0, bottom = n - 1;
        while (left <= right && top <= bottom) 
            for (int column = left; column <= right; column++) 
                matrix[top][column] = num;
                num++;
            
            for (int row = top + 1; row <= bottom; row++) 
                matrix[row][right] = num;
                num++;
            
            if (left < right && top < bottom) 
                for (int column = right - 1; column > left; column--) 
                    matrix[bottom][column] = num;
                    num++;
                
                for (int row = bottom; row > top; row--) 
                    matrix[row][left] = num;
                    num++;
                
            
            left++;
            right--;
            top++;
            bottom--;
        
        return matrix;