Java矩阵的加减乘法

import java.util.Scanner;
 
public class matrix {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.println("请输入选择:1 或 2 或 3");
        System.out.println("1.矩阵加法");
        System.out.println("2.矩阵减法");
        System.out.println("3.矩阵乘法");
        int lei = input.nextInt();
         
        if (lei == 1) {
            matrixadd();
        }
        else if (lei == 2) {
            matrixminus();
        }
        else {
            matrixmulti();
        }
    }
    static void matrixadd() {
        Scanner input = new Scanner(System.in);
        System.out.println("请输入矩阵行数");
        int a = input.nextInt();
        System.out.println("请输入矩阵列数");
        int b = input.nextInt();
        int[][] matrix1 = new int[a][b];
        int[][] matrix2 = new int[a][b];
        int[][] result = new int [a][b];
        System.out.println("请逐行输入第一个矩阵元素:");
        for (int hang = 0; hang < a;hang++) {
            for (int lie = 0; lie < b;lie++) {
                matrix1[hang][lie] = input.nextInt();
            }
        }
        System.out.println("请逐行输入第二个矩阵元素:");
        for (int hang = 0; hang < a;hang++) {
            for (int lie = 0; lie < b;lie++) {
                matrix2[hang][lie] = input.nextInt();
            }
        }
        for (int hang = 0; hang < a;hang++) {
            for (int lie = 0; lie < b;lie++) {
                result[hang][lie] = matrix1[hang][lie] + matrix2[hang][lie];
            }
        }
        for (int i = 0;i<a;i++) {
            for (int j = 0; j<b;j++) {
                System.out.print(result[i][j] + " ");
            }
            System.out.println();
        }
    }
    static void matrixminus() {
        Scanner input = new Scanner(System.in);
        System.out.println("请输入矩阵行数");
        int a = input.nextInt();
        System.out.println("请输入矩阵列数");
        int b = input.nextInt();
        int[][] matrix1 = new int[a][b];
        int[][] matrix2 = new int[a][b];
        int[][] result = new int [a][b];
        System.out.println("请逐行输入第一个矩阵元素:");
        for (int hang = 0; hang < a;hang++) {
            for (int lie = 0; lie < b;lie++) {
                matrix1[hang][lie] = input.nextInt();
            }
        }
        System.out.println("请逐行输入第二个矩阵元素:");
        for (int hang = 0; hang < a;hang++) {
            for (int lie = 0; lie < b;lie++) {
                matrix2[hang][lie] = input.nextInt();
            }
        }
        for (int hang = 0; hang < a;hang++) {
            for (int lie = 0; lie < b;lie++) {
                result[hang][lie] = matrix1[hang][lie] - matrix2[hang][lie];
            }
        }
        for (int i = 0;i<a;i++) {
            for (int j = 0; j<b;j++) {
                System.out.print(result[i][j] + " ");
            }
            System.out.println();
        }
    }
    static void matrixmulti() {
        Scanner input = new Scanner(System.in);
        System.out.println("请输入第一个矩阵的行数");
        int a1 = input.nextInt();
        System.out.println("请输入第一个矩阵列数");
        int b1 = input.nextInt();
        System.out.println("请输入第二个矩阵的行数");
        int a2 = input.nextInt();
        System.out.println("请输入第二个矩阵列数");
        int b2 = input.nextInt();
        if (b1 != a2) {
            System.out.println("Error!第一个矩阵的列数不等于第二个矩阵的行数,所以不能相乘。");
        }
        int[][] matrix1 = new int[a1][b1];
        int[][] matrix2 = new int[a2][b2];
        int[][] result = new int [a1][b2];
        System.out.println("请逐行输入第一个矩阵元素:");
        for (int hang = 0; hang < a1;hang++) {
            for (int lie = 0; lie < b1;lie++) {
                matrix1[hang][lie] = input.nextInt();
            }
        }
        System.out.println("请逐行输入第二个矩阵元素:");
        for (int hang = 0; hang < a2;hang++) {
            for (int lie = 0; lie < b2;lie++) {
                matrix2[hang][lie] = input.nextInt();
            }
        }
        for (int i = 0; i < a1;i++) {
            for (int j = 0;j < b2;j++) {
                for (int k = 0; k < b1; k++) {
                    result[i][j] += matrix1[i][k] * matrix2[k][j]; 
                }
            }
        }
        for (int i = 0;i<a1;i++) {
            for (int j = 0; j<b2;j++) {
                System.out.print(result[i][j] + " ");
            }
            System.out.println();
        }
    }
}

 

  • 4
    点赞
  • 8
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值