题解 | #序列重组矩阵#
序列重组矩阵
https://www.nowcoder.com/practice/7548f8f5e44c42fa84fb2323d899a966
import java.util.*; // 注意类名必须为 Main, 不要有任何 package xxx 信息 public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); int[][] arr = new int[n][m]; for(int i = 0;i<n;i++){ for(int j = 0;j<m;j++){ arr[i][j] = sc.nextInt(); } } for(int i = 0;i<n;i++){ for(int j = 0;j<m;j++){ System.out.print(arr[i][j]+" "); } System.out.println(); } } }