leetcode讲解--867. Transpose Matrix

liuqinh2s

题目

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. 1 <= A.length <= 1000
  2. 1 <= A[0].length <= 1000

题目地址

讲解

转置一个矩阵,简单。

Java代码

class Solution {
    public int[][] transpose(int[][] A) {
        int[][] result = new int[A[0].length][A.length];
        for(int i=0;i<A.length;i++){
            for(int j=0;j<A[i].length;j++){
                result[j][i] = A[i][j];
            }
        }
        return result;
    }
}
阅读 862

liuqinh2s的专栏
我是一个有思想深度的人,所以博客里面会有大量的方法论,慎入

你想学编程?我可以教你啊[链接]

42 声望
13 粉丝
0 条评论

你想学编程?我可以教你啊[链接]

42 声望
13 粉丝
文章目录
宣传栏