Transpose Matrix — LeetCode 867 Python Solution
- Problem
- #867
- Pattern
- Matrix and Grid
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Given a 2D integer array matrix, return the transpose of matrix. The transpose of a matrix is the matrix flipped over its main diagonal, switching the matrix's row and column indices.
Example
- Input
- matrix = [[1,2,3],[4,5,6],[7,8,9]]
- Output
- [[1,4,7],[2,5,8],[3,6,9]]
Python solution
class Solution:
def transpose(self, matrix: List[List[int]]) -> List[List[int]]:
return list(zip(*matrix))Complexity
| Measure | Complexity |
|---|---|
| Time | O(m \times n), where m and n are the number of rows and columns in the matrix \textit{matrix}, respectively |
| Space | O(1) auxiliary |
Pattern: Matrix and Grid
Treat a 2-D grid as a graph whose neighbours are the four adjacent cells. LeetCode 867. Transpose Matrix is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Matrix.
The matrix and grid guide has the Python template for the pattern and the 216 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 867. Transpose Matrix?
- LeetCode 867. Transpose Matrix is rated Easy on LeetCode.
- What is the time complexity of LeetCode 867. Transpose Matrix?
- The Python solution on this page runs in O(m \times n), where m and n are the number of rows and columns in the matrix \textit{matrix}, respectively.
- What is the space complexity of LeetCode 867. Transpose Matrix?
- The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 867. Transpose Matrix cover?
- LeetCode 867. Transpose Matrix is tagged Array, Matrix and Simulation on LeetCode.