LeetCode 867 | Transpose Matrix | Solution Explained (Java)
Running Time : O(Rows * Columns)
Space Complexity: O(Rows * Columns)
The description reads:
"Given a matrix A, return the transpose of A.
The transpose of a matrix is the matrix flipped over it's main diagonal, switching the row and column indices of the matrix.
Example 1:
Input: [[1,2,3],[4,5,6],[7,8,9]]
Output: [[1,4,7],[2,5,8],[3,6,9]]
Example 2:
Input: [[1,2,3],[4,5,6]]
Output: [[1,4],[2,5],[3,6]]"
Always be pluggin:
Github: https://github.com/xavierelon1
Github HackerRank Solutions: https://github.com/XavierElon1/Hacker...
Github Leetcode Solutions: https://github.com/XavierElon1/LeetCo...
Facebook: / xavier.hollingsworth.3
Instagram: / xavierelon
LinkedIn: / xavier-hollingsworth-524144127
Twitter: / elon_xavier
On this page of the site you can watch the video online LeetCode 867 | Transpose Matrix | Solution Explained (Java) with a duration of hours minute second in good quality, which was uploaded by the user Xavier Elon 24 March 2020, share the link with friends and acquaintances, this video has already been watched 1,210 times on youtube and it was liked by 19 viewers. Enjoy your viewing!
