两个大数相乘

import javax.swing.text.rtf.RTFEditorKit;

public class LargeNumMult{
	public static void main(String[] args) {
		String a="424242343242";
		String b="65757567001";
		String finalResult = "0";
		for(int i = b.length()-1,h=0; i >= 0; i--,h++){
			int bSingle = Integer.valueOf(b.substring(i, i+1));
			StringBuilder result = new StringBuilder();
			int remainder = 0;
			for(int j = a.length()-1; j >= 0; j--){
				int singleNum = Integer.valueOf(a.substring(j, j+1));
				int singleResult = bSingle*singleNum+remainder;
				result.append(singleResult%10);
				if (j==0) {
					result.append(singleResult/10);
				}
				remainder = singleResult/10;
			}
			StringBuilder singleResult = result.reverse();
			for(int k = 0; k < h ; k++){
				singleResult.append(0);
			}
			finalResult = add(singleResult.toString(), finalResult).toString();
		}	
		System.out.println(finalResult.replaceAll("0*", ""));	
	}
	
	static StringBuilder add(String s1, String s2){
		if (s1.length()>s2.length()) {
			StringBuilder stringBuilder2 = new StringBuilder(s2).reverse();
			for(int i = 0; i<s1.length()-s2.length(); i++){
				stringBuilder2.append(0);
			}
			s2 = stringBuilder2.reverse().toString();
		}

		StringBuilder addResult = new StringBuilder();
		int addHightPosition = 0;
		for(int i = s1.length()-1; i >=0; i-- ){
			int singleNum1 = Integer.valueOf(s1.substring(i, i+1));
			int singleNum2 = Integer.valueOf(s2.substring(i, i+1));
			int singleResult = singleNum1+singleNum2+addHightPosition;
			addResult.append(singleResult%10);
			addHightPosition = singleResult/10;
			if (i==0) {
				addResult.append(addHightPosition);
			}
		}
		addResult.reverse();
		
		System.out.println("add "+addResult);
		return addResult;
	}
}

以下是一个基于链表的 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、付费专栏及课程。

余额充值