leetcode 59. Spiral Matrix II

最新推荐文章于 2022-10-26 18:53:30 发布

原创最新推荐文章于 2022-10-26 18:53:30 发布 · 316 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #leetcode

本文介绍了一个生成螺旋矩阵的算法实现，该算法接受一个整数n作为输入，返回一个n×n的螺旋矩阵，矩阵元素从1到n²按螺旋顺序填充。通过控制四个边界的变化，实现了矩阵的螺旋填充。

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

package com.bupt;

//Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.
//
//For example,
//Given n = 3,
//
//You should return the following matrix:
//[
// [ 1, 2, 3 ],
// [ 8, 9, 4 ],
// [ 7, 6, 5 ]
//]

public class Solution {
	 public int[][] generateMatrix(int n) {
		 int[][] result = new int[n][n];
		 int number = 1;
		 int minLength = 0;
		 int maxLength = n-1;
		 while(number<=n*n){
			 int index = minLength;
			 while(index <= maxLength){
				 result[minLength][index] = number;
				 number++;
				 index++;
			 }
			 minLength++;
			 index = minLength;
			 while(index<=maxLength){
				 result[index][maxLength] = number;
				 number++;
				 index++;
			 }
			 maxLength--;
			 minLength--;
			 index = maxLength;
			 while(index>=minLength){
				 result[maxLength+1][index] = number;
				 number++;
				 index--;
			 }
			 minLength++;
			 index = maxLength;
			 while(index>=minLength){
				 result[index][minLength-1] = number;
				 number++;
				 index--;
			 }
		 }
		 return result;
	 }
    
    public static void main(String[] args){
    	Solution s = new Solution();
    	int[][] output = s.generateMatrix(1);
    	for(int i = 0;i<output.length;i++){
    		for(int j = 0;j<output.length;j++){
    			System.out.print(output[i][j]);
    		}
    		System.out.println();
    	}
    }
}