题目链接:https://leetcode-cn.com/problems/transpose-matrix/description/
思路:直接翻转
class Solution {
public int[][] transpose(int[][] A) {
int row=A.length;
int coloum=A[0].length;
int[][] res=new int[coloum][row];
for (int i=0;i<row;i++){
for (int j=0;j<coloum;j++){
res[j][i]=A[i][j];
}
}
return res;
}
}