⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 matrixzong.java

📁 该算法的功能是描述两矩阵之间相加
💻 JAVA
字号:
import java.io.*;
class Matrix
{
 int n;
 int[][] a;
 Matrix(int n,int a[][])
 {
   this.n=n;
   this.a=a;
 }
 public Matrix add(Matrix e)
 {
   Matrix f;
   int[][] sum=new int[n][n];
   for(int i=0;i<n;i++)
     { 
      for(int j=0;j<n;j++)
        sum[i][j]=this.a[i][j]+e.a[i][j];
     }
   f=new Matrix(n,sum);
   return f;
 }
 public Matrix sub(Matrix e)
 {
   Matrix f;
   int[][] sub1=new int[n][n];
   for(int i=0;i<n;i++)
     for(int j=0;j<n;j++)
        sub1[i][j]=this.a[i][j]-e.a[i][j];
   f=new Matrix(n,sub1);
   return f;
 }
public Matrix zhuanZhi(Matrix e)
 {
   Matrix f;
   int[][] s=new int[n][n];
   for(int i=0;i<n;i++)
     for(int j=0;j<n;j++)
        s[j][i]=e.a[i][j];
   f=new Matrix(n,s);
   return f;
 }
 public String toString()
 {
  String m="";
  for(int i=0;i<n;i++)
   {
    for(int j=0;j<n;j++)
     m=m+a[i][j]+" ";
     m=m+"\n"+" "	;
   }
  return m;
 }
}
/*class Shuchu
{
	public void shuChu(Matrix t,int n)
	{
   for(int i=0;i<n;i++)
   {
     for(int j=0;j<n;j++)
     System.out.print(t.a[i][j]+"   ");
     System.out.println("");
     
   }
  }
}*/
class Shuru
{
 public String chuanZhi()throws IOException
 {
  BufferedReader din =new BufferedReader(new InputStreamReader(System.in));
  String d=din.readLine();
  return d;
 }
}
public class MatrixZong
{
 public static void main(String[] args)throws IOException
 {
  Shuru t=new Shuru();
  //Shuchu b=new Shuchu();
  int p=0,q=0;
  System.out.println("请输入维数:");
  String h=t.chuanZhi();
  int n=Integer.parseInt(h);
  int[][] array1=new int[n][n];
  int[][] array2=new int[n][n];
  System.out.println("请输入"+n+"维矩阵数值,注意每输一个换行:");
     for(int j=0;j<n;j++)
      {
       for(int k=0;k<n;k++)
       {
           p=Integer.parseInt(t.chuanZhi());
           array1[j][k]=p;
          }
     }  
  System.out.println("请输入另一"+n+"维矩阵数值,注意每输一个换行:");
     for(int j=0;j<n;j++)
      {
       for(int k=0;k<n;k++)
        {
          q=Integer.parseInt(t.chuanZhi());
          array2[j][k]=q;
        }
      }   
 /*for(int j=0;j<n;j++)
   {
     for(int k=0;k<n;k++)
     System.out.print(array1[j][k]+" "); 
     System.out.println(" ");
   }*/
  Matrix matrix1=new Matrix(n,array1);
  Matrix matrix2=new Matrix(n,array2);
  Matrix matrix3,matrix4,matrix5;
  matrix3=matrix1.add(matrix2);
  matrix4=matrix1.sub(matrix2);
  matrix5=matrix1.zhuanZhi(matrix2);
  System.out.println("输出初始化矩阵: ");
  System.out.print(" "+matrix1);
  System.out.println("输出初始化矩阵: ");
  System.out.print(" "+matrix2);
  System.out.println("矩阵之和为:");
  System.out.print(" "+matrix3);
  /*for(int i=0;i<n;i++)
   {
     for(int j=0;j<n;j++)
     System.out.print(matrix3.a[i][j]+" ");
     System.out.println("");
     
   } */
  //b.shuChu(matrix3,n);
  System.out.println("矩阵之差为:");
  System.out.print(" "+matrix4);
  /*for(int i=0;i<n;i++)
   {
     for(int j=0;j<n;j++)
     System.out.print(matrix4.a[i][j]+" ");
     System.out.println("");
     
   } */
   //b.shuChu(matrix4,n);
   System.out.println("矩阵的转置矩阵为:");
   System.out.print(" "+matrix5);
   /*for(int i=0;i<n;i++)
   {
     for(int j=0;j<n;j++)
     System.out.print(matrix5.a[i][j]+" ");
     System.out.println("");
     
   } */
  // b.shuChu(matrix5,n);
 }
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -