字符串相乘【大数乘法】

43. 字符串相乘

Difficulty: 中等

给定两个以字符串形式表示的非负整数 num1 和 num2,返回 num1 和 num2 的乘积,它们的乘积也表示为字符串形式。

示例 1:

输入: num1 = "2", num2 = "3"
输出: "6"

示例 2:

输入: num1 = "123", num2 = "456"
输出: "56088"

说明:

  1. num1 和 num2 的长度小于110。
  2. num1 和 num2 只包含数字 0-9
  3. num1 和 num2 均不以零开头,除非是数字 0 本身。
  4. 不能使用任何标准库的大数类型(比如 BigInteger)直接将输入转换为整数来处理
Solution

Language: ****

class Solution {
public:
    string multiply(string num1, string num2) {
        int size_1 = num1.size(),size_2 = num2.size();
        string res(size_2+size_1,'0');
        for (int i=size_1-1;i>=0;--i) {
            for (int j = size_2 -1; j>=0;--j) {
                int _t = res[i+j+1]-'0' + (num2[j]-'0') * (num1[i]-'0');
                //当前位置 + 进位
                res[i+j+1] = _t%10 + '0';
                res[i+j]  += _t/10;
            }
        }
        for (int i=0,n=res.size(); i<n;++i) {
            if (res[i]!='0') return res.substr(i);
        }

        return {'0'};
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
实现大数乘法可以使用链表来存储每一位数字,具体实现步骤如下: 1. 定义链表结构体,包含一个int类型的数据域和指向下一个节点的指针域。 ```c typedef struct node { int data; struct node *next; } Node; ``` 2. 定义两个字符串,分别存储要相乘的两个大数。 ```c char num1[] = "123456789"; char num2[] = "987654321"; ``` 3. 将两个字符串转化为链表,将每一位数字存储到链表中。 ```c Node *num1List = NULL; Node *num2List = NULL; for (int i = strlen(num1) - 1; i >= 0; i--) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = num1[i] - '0'; newNode->next = num1List; num1List = newNode; } for (int i = strlen(num2) - 1; i >= 0; i--) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = num2[i] - '0'; newNode->next = num2List; num2List = newNode; } ``` 4. 定义一个新的链表,用来存储计算结果。 ```c Node *resultList = NULL; ``` 5. 从链表num2List的最低位开始,依次将每一位与链表num1List中的每一位相乘,将计算结果相加得到最终结果。具体实现过程如下: ```c Node *num2Node = num2List; int shift = 0; // 用于记录当前位数,也就是需要在结果中加上的0的个数 while (num2Node != NULL) { Node *num1Node = num1List; int carry = 0; // 用于记录进位 Node *tempResultList = NULL; // 在结果中加上shift个0 for (int i = 0; i < shift; i++) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = 0; newNode->next = tempResultList; tempResultList = newNode; } while (num1Node != NULL) { int tempResult = num1Node->data * num2Node->data + carry; carry = tempResult / 10; Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = tempResult % 10; newNode->next = tempResultList; tempResultList = newNode; num1Node = num1Node->next; } // 如果还有进位,需要将进位加到结果的最高位 if (carry > 0) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = carry; newNode->next = tempResultList; tempResultList = newNode; } // 将tempResultList中的结果与resultList相加 Node *tempNode = tempResultList; Node *resultNode = resultList; carry = 0; while (tempNode != NULL || carry > 0) { int tempData1 = resultNode == NULL ? 0 : resultNode->data; int tempData2 = tempNode == NULL ? 0 : tempNode->data; int tempResult = tempData1 + tempData2 + carry; carry = tempResult / 10; if (resultNode == NULL) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = tempResult % 10; newNode->next = NULL; resultList = newNode; resultNode = resultList; } else { resultNode->data = tempResult % 10; if (resultNode->next == NULL && (tempNode != NULL || carry > 0)) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = 0; newNode->next = NULL; resultNode->next = newNode; } resultNode = resultNode->next; } tempNode = tempNode == NULL ? NULL : tempNode->next; } shift++; num2Node = num2Node->next; } ``` 6. 将计算结果从链表中取出,输出到控制台。 ```c Node *tempNode = resultList; while (tempNode != NULL) { printf("%d", tempNode->data); tempNode = tempNode->next; } printf("\n"); ``` 完整代码如下: ```c #include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct node { int data; struct node *next; } Node; int main() { char num1[] = "123456789"; char num2[] = "987654321"; Node *num1List = NULL; Node *num2List = NULL; for (int i = strlen(num1) - 1; i >= 0; i--) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = num1[i] - '0'; newNode->next = num1List; num1List = newNode; } for (int i = strlen(num2) - 1; i >= 0; i--) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = num2[i] - '0'; newNode->next = num2List; num2List = newNode; } Node *resultList = NULL; Node *num2Node = num2List; int shift = 0; while (num2Node != NULL) { Node *num1Node = num1List; int carry = 0; Node *tempResultList = NULL; for (int i = 0; i < shift; i++) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = 0; newNode->next = tempResultList; tempResultList = newNode; } while (num1Node != NULL) { int tempResult = num1Node->data * num2Node->data + carry; carry = tempResult / 10; Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = tempResult % 10; newNode->next = tempResultList; tempResultList = newNode; num1Node = num1Node->next; } if (carry > 0) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = carry; newNode->next = tempResultList; tempResultList = newNode; } Node *tempNode = tempResultList; Node *resultNode = resultList; carry = 0; while (tempNode != NULL || carry > 0) { int tempData1 = resultNode == NULL ? 0 : resultNode->data; int tempData2 = tempNode == NULL ? 0 : tempNode->data; int tempResult = tempData1 + tempData2 + carry; carry = tempResult / 10; if (resultNode == NULL) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = tempResult % 10; newNode->next = NULL; resultList = newNode; resultNode = resultList; } else { resultNode->data = tempResult % 10; if (resultNode->next == NULL && (tempNode != NULL || carry > 0)) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = 0; newNode->next = NULL; resultNode->next = newNode; } resultNode = resultNode->next; } tempNode = tempNode == NULL ? NULL : tempNode->next; } shift++; num2Node = num2Node->next; } Node *tempNode = resultList; while (tempNode != NULL) { printf("%d", tempNode->data); tempNode = tempNode->next; } printf("\n"); return 0; } ```

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值