几种矩阵,通过Java实现
import java.util.Scanner;
public class JuZhen {
public static void main(String[] args) {
Scanner input=new Scanner(System.in);
int n=input.nextInt();
int[][] a=new int[n][n];
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a.length; j++) {
a[i][j]=i*n+j+1;
}
}
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a.length; j++) {
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
System.out.println("\n");
for (int j = 0; j < a.length; j++) {
for (int i = 0; i < a.length; i++) {
a[j][i]=i*n+j+1;
}
}
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a.length; j++) {
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
System.out.println("\n");
int t=1;
for (int j = a.length-1; j >=0; j--) {
for (int i = 0; i < a.length; i++) {
a[i][j]=t++;
}
}
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a.length; j++) {
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
}
}