LeetCode Spiral Matrix II Solution Explained - Java

[@culleyb]

Excellent video. Thank you Nick for making these videos. Below is an alternative solution I developed. It uses a single "level" tracker, rather than the row start + end and column start + end trackers. Each level is one "spiral" around the outside edge of the currently active region. public int[][] generateMatrix(int n) { int[][] matrix = new int[n][n]; int level = 0; int currentNumber = 1; while (level = level; i--) { int rowIndex = n - level - 1; matrix[rowIndex][i] = currentNumber++; } // fill in left side column for (int i = n - level - 2; i > level ; i--) { /* the "> level" bound takes care of not overlapping with the top row that's already been filled in for tis level */ matrix[i][level] = currentNumber++; } level++; } return matrix; }

[@indiansoftwareengineer4899]

thanks Brad.

[@user-pr6lv7nd6l]

I did the same way

[@Demonic79221]

Thanks for the simple and clear explanation! This solution is easy understanding than LeetCode Editorials.

[@satyamgupta6030]

thanks alot nick already saw the last video just saw this video if I could learn something new and guess what I did thanks.

[@mertyertugrul]

Thank you good work 👍

[@millionaires1]

Nice explanation

[@velmuruganr9321]

buddy can you do spiral 3 in leetcode?

[@deepeshgurnani1671]

Hi, Great video Can you make a video for spiral matrix 3 885 leetcode medium ?

[@miguelballen4119]

Nice solution

[@hhjdkdnchidnd]

Hi Nick can you make a video for Spiral Matrix III (885)? I am still confused it. Thank you