Transpose Matrix - Array - Easy - LeetCode
💻 coding

Transpose Matrix - Array - Easy - LeetCode

1 min read 90 words
1 min read
ShareWhatsAppPost on X
  • 1The transpose of a matrix is obtained by flipping it over its main diagonal, switching rows and columns.
  • 2Example inputs demonstrate the transposition of matrices, yielding different output structures based on the original dimensions.
  • 3The provided solution has a time complexity of O(n*m) and a space complexity of O(m*n).

AI-generated summary · May not capture all nuances

Key Insight
AskGif

"The transpose of a matrix is obtained by flipping it over its main diagonal, switching rows and columns."

Transpose Matrix - Array - Easy - LeetCode

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]]

Note:

1 <= A.length <= 1000 1 <= A[0].length <= 1000

public class Solution {
 public int[][] Transpose(int[][] A) { 
 var res = new int[A[0].Length][]; 
 for(int i=0;i<A[0].Length;i++){
 res[i]=new int[A.Length]; 
 }
 
 for(int i=0;i<A.Length;i++){ 
 for(int j=0;j<A[i].Length;j++){
 res[j][i]=A[i][j];
 }
 }
 
 return res;
 }
}

Time Complexity: O(n*m)

Space Complexity: O(m*n)

Enjoyed this article?

Share it with someone who'd find it useful.

ShareWhatsAppPost on X

sumitc91

Published on 26 September 2020 · 1 min read · 90 words

Part of AskGif Blog · coding

You might also like