LeetCode 솔루션

[6/2] 867. Transpose Matrix

Jack 쪽지보내기 메일보내기 자기소개 아이디로 검색 전체게시물 작성
작성일 2022.06.02 21:15

8,460 조회
5 댓글
0 추천
0 비추천
목록

글검색

게시글 쓰기

867. Transpose Matrix

Easy

2013396Add to ListShare

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 1:

Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
Output: [[1,4,7],[2,5,8],[3,6,9]]

Example 2:

Input: matrix = [[1,2,3],[4,5,6]]
Output: [[1,4],[2,5],[3,6]]

Constraints:

m == matrix.length
n == matrix[i].length
1 <= m, n <= 1000
1 <= m * n <= 105
-109 <= matrix[i][j] <= 109

#leetcode, #문제풀이, #easy, #amazon, #apple, #microsoft, #citadel, #array, #matrix, #simulation

링크

https://leetcode.com/problems/transpose-matrix/ 2149 회 연결

익명
작성일 2022.06.02 21:31

class Solution:
    def transpose(self, matrix: List[List[int]]) -> List[List[int]]:
        r = len(matrix)
        c = len(matrix[0])
        ans = [[0] * r for _ in range(c)]
        for i in range(r):
            for j in range(c):
                if i != j:
                    ans[j][i] = matrix[i][j]
                else:
                    ans[i][j] = matrix[i][j]
        return ans

익명
작성일 2022.06.02 21:32

class Solution {
public:
    vector<vector<int>> transpose(vector<vector<int>>& matrix) {
        int row = matrix.size();
        int col = matrix[0].size();
        
        
            vector<vector<int>> ret(col, vector<int>(row, 0)) ;
        
            for(int i = 0; i < row; i++){
                for(int j = 0; j < col; j++){                
                    ret[j][i] = matrix[i][j];
                }            
            }
            return ret;    
        /*
        else{
            int tmp = 0;
            
            for(int i = 0; i < row; i++){
                for(int j = 0; j < row; j++){
                    if(j == row-1-i)
                        break;
                    
                    // [0,row-1] [1, row-2], [2, row-3]
                    // [0, 2] 
                    tmp = matrix[i][j];
                    matrix[i][j] = matrix[j][i];
                    matrix[j][i] = tmp;
                }
            }            
            
            return matrix;
        }
        */
        
    }
};

[code=c]class Solution {
public:
    vector<vector<int>> transpose(vector<vector<int>>& matrix) {
        int row = matrix.size();
        int col = matrix[0].size();
        
        
            vector<vector<int>> ret(col, vector<int>(row, 0)) ;
        
            for(int i = 0; i < row; i++){
                for(int j = 0; j < col; j++){                
                    ret[j][i] = matrix[i][j];
                }            
            }
            return ret;    
        /*
        else{
            int tmp = 0;
            
            for(int i = 0; i < row; i++){
                for(int j = 0; j < row; j++){
                    if(j == row-1-i)
                        break;
                    
                    // [0,row-1] [1, row-2], [2, row-3]
                    // [0, 2] 
                    tmp = matrix[i][j];
                    matrix[i][j] = matrix[j][i];
                    matrix[j][i] = tmp;
                }
            }            
            
            return matrix;
        }
        */
        
    }
};[/code]

익명
작성일 2022.06.02 21:33

Python3
Runtime: 131 ms, faster than 21.67% of Python3 online submissions for Transpose Matrix.
Memory Usage: 14.7 MB, less than 55.25% of Python3 online submissions for Transpose Matrix.

class Solution:
    def transpose(self, matrix: List[List[int]]) -> List[List[int]]:
        ROW, COL = len(matrix), len(matrix[0])
        
        res = [ [matrix[0][i]] for i in range(COL) ]
        
        for item in matrix[1:]:
            for i in range(COL):
                res[i].append(item[i])
        
        return res

익명
작성일 2022.06.03 18:45

Python3

Runtime: 144 ms, faster than 12.24% of Python3 online submissions for Transpose Matrix.
Memory Usage: 14.9 MB, less than 16.79% of Python3 online submissions for Transpose Matrix.

class Solution:
    def transpose(self, matrix: List[List[int]]) -> List[List[int]]:
        row = len(matrix)
        col = len(matrix[0])

        if row != col:
            result = [[None] * row for _ in range(col)]
            for r, rval in enumerate(matrix):
                for c, cval in enumerate(rval):
                    result[c][r]=cval
            return result
        else:
            for c in range(col):
                for r in range(row):
                    if c != r and r > c:
                        matrix[c][r], matrix[r][c] = matrix[r][c], matrix[c][r]
            return matrix

익명
작성일 2022.06.08 18:08

class Solution {
    public int[][] transpose(int[][] matrix) {
        int row = matrix.length;
        int col = matrix[0].length;
        
        int[][] result = new int[col][row];
        
        for(int i=0; i<row; i++){
            for(int j=0; j<col; j++){
                result[j][i] = matrix[i][j];
            }
        }
        
        return result;
    }
    
    
}