Java实现俩个大数相乘

不用BigInteger实现两个大数字相乘

思路

位数123
数字345
678

如表所示
两个数345和678
两个数位数相加为6的数积为40
两个数位数相加为5的数为32+35
两个数位数相加为4的数为24+30+28
两个数位数相加为3的数为21+24
两个数位数相加为2的数为18
然后逐次进行进位得到最终的数
在这里插入图片描述

代码实现

    public static void main(String[] args) {
        System.out.println("请输入两个大数");
        Scanner scanner = new Scanner(System.in);
        if (scanner.hasNext()){
            String num1 = scanner.next();
            String num2 = scanner.next();
            System.out.println("相乘结果为:"+getNum(num1, num2));
        }

    }


    public static String getNum(String num1,String num2){
        char[] char1 = num1.toCharArray();
        char[] char2 = num2.toCharArray();

        List<Integer> list1 = new ArrayList<>();
        List<Integer> list2 = new ArrayList<>();

        //将char字符串转换为对应的数字
        for (char c : char1) {
            list1.add(c - '0');
        }
        for (char c : char2) {
            list2.add(c - '0');
        }
        //设置一个定长的集合用于存放计算过后的结果
        List<Integer> resList = new ArrayList<>(Collections.nCopies(list1.size()+list2.size(),0));

        for (int i = 0; i < list1.size(); i++) {
            for (int j = 0; j < list2.size(); j++) {
                resList.set(i+j,resList.get(i+j)+list1.get(i)*list2.get(j));
            }
        }

        for (int i = resList.size() - 1; i > 0; i--) {
            resList.set(i-1,resList.get(i-1)+resList.get(i)/10);
            resList.set(i,resList.get(i)%10);
        }
        StringBuffer sb = new StringBuffer();
        resList.stream().limit(resList.size()-1).forEach(i->{
            sb.append(i);
        });

        return sb.toString();
    }

测试结果

在这里插入图片描述

在这里插入图片描述

  • 1
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是一个基于链表的 C 语言代码,用于计算大数的乘积。 ```c #include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; typedef struct node Node; Node *create_node(int num) { Node *new_node = (Node *) malloc(sizeof(Node)); new_node->data = num; new_node->next = NULL; return new_node; } Node *insert_at_end(Node *head, int num) { Node *new_node = create_node(num); if (head == NULL) { head = new_node; return head; } Node *temp = head; while (temp->next != NULL) { temp = temp->next; } temp->next = new_node; return head; } Node *reverse_list(Node *head) { Node *prev = NULL, *current = head, *next = NULL; while (current != NULL) { next = current->next; current->next = prev; prev = current; current = next; } return prev; } Node *multiply_lists(Node *head1, Node *head2) { Node *result = NULL; Node *temp1 = head1, *temp2; int carry = 0, sum; while (temp1 != NULL) { temp2 = head2; Node *new_node = NULL; carry = 0; while (temp2 != NULL) { sum = (temp1->data * temp2->data) + carry; carry = sum / 10; new_node = insert_at_end(new_node, sum % 10); temp2 = temp2->next; } if (carry > 0) { new_node = insert_at_end(new_node, carry); } new_node = reverse_list(new_node); for (int i = 0; i < temp1->data; i++) { new_node = insert_at_end(new_node, 0); } result = add_lists(result, new_node); temp1 = temp1->next; } return result; } Node *add_lists(Node *head1, Node *head2) { Node *result = NULL; Node *temp1 = head1, *temp2 = head2; int carry = 0, sum; while (temp1 != NULL || temp2 != NULL) { sum = carry + (temp1 != NULL ? temp1->data : 0) + (temp2 != NULL ? temp2->data : 0); carry = sum / 10; result = insert_at_end(result, sum % 10); if (temp1 != NULL) { temp1 = temp1->next; } if (temp2 != NULL) { temp2 = temp2->next; } } if (carry > 0) { result = insert_at_end(result, carry); } return result; } void display_list(Node *head) { Node *temp = head; while (temp != NULL) { printf("%d", temp->data); temp = temp->next; } printf("\n"); } int main() { Node *num1 = NULL, *num2 = NULL, *result = NULL; char c; int num; printf("Enter first number:\n"); while ((c = getchar()) != '\n') { num = c - '0'; num1 = insert_at_end(num1, num); } printf("Enter second number:\n"); while ((c = getchar()) != '\n') { num = c - '0'; num2 = insert_at_end(num2, num); } num1 = reverse_list(num1); num2 = reverse_list(num2); result = multiply_lists(num1, num2); printf("Result:\n"); display_list(result); return 0; } ``` 该代码将大数存储为链表,并使用一个辅助函数来反转链表。然后,它将个链表相乘,产生一个新的链表,该链表包含结果。最后,它将结果链表打印到控制台上。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值