转置矩阵

问题描述：

样例输入：

代码如下：

package Leetcode;
import java.util.Arrays;
import java.util.Scanner;
public class Transpose {
    public static int[][] transpose(int[][] matrix) {
        int len=matrix.length;
        int len1=matrix[0].length;
        int [][]res=new int[len1][len];
        for (int i = 0; i <len ; i++) {
            for (int j = 0; j <len1 ; j++) {
                res[j][i]=matrix[i][j];
            }
        }
        return res;
    }

    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        int len=scanner.nextInt();
        int len1=scanner.nextInt();
        int [][]matrix=new int[len][len1];
        for (int i = 0; i <len ; i++) {
            for (int j = 0; j <len1 ; j++) {
                matrix[i][j]=scanner.nextInt();
            }
        }
        int [][]res=transpose(matrix);
        for (int i = 0; i <len ; i++) {
            System.out.println(Arrays.toString(res[i]));
        }
    }
}

结果如下：