count.java

来自「对基本数组的转换」· Java 代码 · 共 59 行

class Matrix{
    int n;
    int s[][];
public Matrix(int n,int s[][]){
    this.n=n;
    this.s=s;  }
public Matrix(){}
public Matrix add(Matrix a,Matrix b){
    for(int i=0;i<n;i++)
    for(int j=0;j<n;j++)
      b.s[i][j]=this.s[i][j]+a.s[i][j];
      return b;  }
public Matrix miu(Matrix a,Matrix b){
     for(int i=0;i<n;i++)
     for(int j=0;j<n;j++)
     b.s[i][j]=this.s[i][j]-a.s[i][j];
     return b;   }
public Matrix che(Matrix a){
     for(int i=0;i<n;i++)
     for(int j=0;j<n;j++)
     a.s[i][j]=this.s[j][i];
     return a;  }
public String toString(){
    String c="";
    for(int i=0;i<n;i++){
    for(int j=0;j<n;j++)
    c=c+this.s[i][j]+"";
    c=c+"\n";   }
    return c;     }  }
public class count{
public static void main(String args[]){
    int n=3;
    int x[][]=new int[n][n];
    int y[][]=new int[n][n];
    int z[][]=new int[n][n];
    Matrix no1=new Matrix(n,x);
    Matrix no2=new Matrix(n,y);
    Matrix no3=new Matrix(n,z);
    for(int i=0;i<3;i++)
    for(int j=0;j<3;j++) {
       no1.s[i][j]=(int)(Math.random()*10);
       no2.s[i][j]=(int)(Math.random()*10);}
    System.out.println("第一个矩阵为：");
    System.out.println(no1);
    System.out.println("第二个矩阵为：");
    System.out.println(no2);
    no3=no1.add(no2,no3);
    System.out.println("两个矩阵相加得：");
    System.out.println(no3);
    no3=no1.miu(no2,no3);
    System.out.println("两个矩阵相减得：");
   System.out.println(no3);
   no3=no1.che(no3);
   System.out.println("第一个矩阵的转置矩阵为：");
   System.out.println(no3);
}}