Leetcode 43. Multiply Strings

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Multiply Strings

2. Solution

**解析:**Version 1,直接按照学习的乘法计算方式来求解,先计算第二个数的每一位(从个位开始)乘以第一个数,再将得出的结果加到一起。Version 2采用另一种方式实现。

  • Version 1
class Solution:
    def multiply(self, num1: str, num2: str) -> str:
        if num1 == '0' or num2 == '0':
            return '0'
        result = []
        carry = 0
        num1 = list(map(int, num1))
        num2 = list(map(int, num2))
        for i in range(len(num2) -1, -1, -1):
            if num2[i] == 0:
                continue
            temp = self.mul(num1, num2[i], len(num2) - i - 1)
            result = self.add(result, temp)
        p = [str(num) for num in result]
        return ''.join(p)[::-1]


    def mul(self, num1, b, index):
        result = []
        carry = 0
        for a in reversed(num1):
            product = a * b + carry
            result.append(product % 10)
            carry = product // 10
        if carry > 0:
            result.append(carry)
        return [0] * index + result


    def add(self, a, b):
        carry = 0
        for i in range(len(b)):
            if i < len(a):
                x = a[i]
            else:
                x = 0
            y = b[i]
            sum = x + y + carry
            b[i] = sum % 10
            carry = sum // 10
        if carry > 0:
            b.append(carry)
        return b
  • Version 2
class Solution:
    def multiply(self, num1: str, num2: str) -> str:
        if num1 == '0' or num2 == '0':
            return '0'
        num1 = list(map(int, num1))
        num2 = list(map(int, num2))
        m = len(num1)
        n = len(num2)
        result = [0] * (m + n)
        for i in range(m-1, -1, -1):
            for j in range(n-1, -1, -1):
                product = num1[i] * num2[j]
                sum = product + result[i+j+1]
                result[i+j+1] = sum % 10
                result[i+j] += sum // 10
        result = list(map(str, result))
        result = ''.join(result).lstrip('0')
        return result

Reference

  1. https://leetcode.com/problems/multiply-strings//
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值