题解 | 矩阵转置

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();//代表行数
        int n = sc.nextInt();//代表列数
        int e ;
        if(m > n){
            e = m;
        }
        else
        { 
            e = n; 
        }
        int [][] arr = new int[e][e];//让矩阵的容量放到最大
        //录入初始矩阵
        for (int i = 0; i <m ; i++) {
            for (int j = 0; j <n ; j++) {
                arr[i][j] = sc.nextInt();
            }
        }
        for (int i = 0; i <e ; i++) {
            for (int j = 0; j <e ; j++) {
                if(arr[j][i]==0){
                    break;
                }
                   System.out.print(arr[j][i]+" ");
            }
            System.out.println();
        }
    }
}