该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
package homework;
import java.util.*;
public class Sz_two {
public static void main(String[]args) {
Scanner in = new Scanner(System.in);
int a[][]=new int[3][3];
Scanner sc=new Scanner(System.in);
System.out.println("输入一个矩阵数组:");
int i;
int j;
for(i=0;i
for(j=0;j
a[i][j]=sc.nextInt();
}
}
int n = a.length; //行数
int m = a[0].length; //列数
int r[][]= new int[n][m];//转换后的新数组矩阵
//转置
System.out.println("转置后的矩阵");
for (i = 0; i < n; i++) {
for ( j = 0; j < m; j++) {
r[i][j] = a[j][i];
}
}
for ( i = 0; i < n; i++) {
for ( j = 0; j < m; j++) {
System.out.print(r[i][j] + " ");
}
System.out.println();
}
int hang = 0;
int lie = 0;
int max;
max=a[0][0];
for( i=0;i
for( j=0;j
if(a[i][j]>max)
max=a[i][j];
hang=i;
lie=j;
}
}
System.out.print("原矩阵中最大的数为:"+max+"\t");
System.out.print("对应的行列数分别为:"+hang+", ");
System.out.println(lie);
int min;
min=a[0][0];
for( i=0;i
for( j=0;j
if(a[i][j]
min=a[i][j];
hang=i;
lie=j;
}
}
System.out.println("原矩阵中最小的数为:"+min);
System.out.print("对应的行列数分别为:"+hang+", "+lie);
}
}