Last active
February 22, 2023 21:54
-
-
Save lienista/af013a6425eaf781cbc659474f0b91b6 to your computer and use it in GitHub Desktop.
(Algorithms in Javascript) Leetcode 54. Print Spiral Matrix - Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const spiralOrder = (matrix) => { | |
| if(!matrix.length || !matrix[0].length){ | |
| return []; | |
| } | |
| //Use 4 pointes to create wall around square | |
| let rowBegin = 0, | |
| rowEnd = matrix.length - 1, | |
| colBegin = 0, | |
| colEnd = matrix[0].length - 1; | |
| let result = []; | |
| while(rowBegin <= rowEnd && colBegin <= colEnd){ | |
| //move right | |
| for(let i= colBegin; i<= colEnd; i++){ | |
| result.push(matrix[rowBegin][i]); | |
| } | |
| rowBegin++; // mark row as traversed after moving right | |
| //move down | |
| for(let i=rowBegin; i<= rowEnd; i++){ | |
| result.push(matrix[i][colEnd]); | |
| } | |
| colEnd--; //mark column as traversed after moving down | |
| //move left | |
| if(rowBegin <= rowEnd){ | |
| for(let i=colEnd; i >= colBegin; i--){ | |
| result.push(matrix[rowEnd][i]); | |
| } | |
| } | |
| rowEnd--; //mark end row as traversed after moving left | |
| //move up | |
| if(colBegin <= colEnd){ | |
| for(let i=rowEnd; i >= rowBegin; i--){ | |
| result.push(matrix[i][colBegin]); | |
| } | |
| } | |
| colBegin++; //mark begining column as traversed after moving up | |
| } | |
| return result; | |
| }; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment