LeetCode43——Multiply Strings（两个字符串表示的整数相乘）？？？

题目：

参考解法：

法一：

This is the standard manual multiplication algorithm. We use two nested for loops, working backward from the end of each input number. We pre-allocate our result and accumulate our partial result in there. One special case to note is when our carry requires us to write to our sum string outside of our for loop.

At the end, we trim any leading zeros, or return 0 if we computed nothing but zeros.

string multiply(string num1, string num2) {string sum(num1.size() + num2.size(), '0');for (int i = num1.size() - 1; 0 <= i; --i) {int carry = 0;for (int j = num2.size() - 1; 0 <= j; --j) {int tmp = (sum[i + j + 1] - '0') + (num1[i] - '0') * (num2[j] - '0') + carry;sum[i + j + 1] = tmp % 10 + '0';carry = tmp / 10;}sum[i] += carry;}size_t startpos = sum.find_first_not_of("0");if (string::npos != startpos) {return sum.substr(startpos);}return "0";
}

法二：The key part is to use a vector to store all digits REVERSELY. after the calculation, find the rightmost NON-Zero digits and convert it to a string.

class Solution {
public:string multiply(string num1, string num2) {unsigned int l1=num1.size(),l2=num2.size();if (l1==0||l2==0) return "0";vector<int> v(l1+l2,0);for (unsigned int i=0;i<l1;i++){int carry=0;int n1=(int)(num1[l1-i-1]-'0');//Calculate from rightmost to leftfor (unsigned int j=0;j<l2;j++){int n2=(num2[l2-j-1]-'0');//Calculate from rightmost to leftint sum=n1*n2+v[i+j]+carry;carry=sum/10;v[i+j]=sum%10;}if (carry>0)v[i+l2]+=carry;}int start=l1+l2-1;while(v[start]==0) start--;if (start==-1) return "0";string s="";for (int i=start;i>=0;i--)s+=(char)(v[i]+'0');return s;}
};

分析：

两个数相乘，最后的结果的长度，最大为两个乘数的长度之和。

LeetCode43——Multiply Strings（两个字符串表示的整数相乘）？？？相关推荐

python字符串能减吗_在python中减去两个字符串(Subtract two strings in python)
在python中减去两个字符串(Subtract two strings in python) 我应该计算两个不同列表的元素之间的差异. 这是我的代码: import operator a = ['5 ...
leetcode 712. Minimum ASCII Delete Sum for Two Strings | 712. 两个字符串的最小ASCII删除和（暴力递归-＞傻缓存-＞DP）
题目 https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/ 题解经典的暴力递归 -> 傻缓存 -&g ...
[leetcode]Multiply Strings @ Python
原题地址:https://oj.leetcode.com/problems/multiply-strings/ 题意: Given two numbers represented as strings ...
php俩个字符串合并,php分割合并两个字符串的函数实例
本文实例讲述了php分割合并两个字符串的函数..具体实现方法如下: 这里实现把两个字符串进行分割合并,例如str1=aaaa,str2=bbbb,合并后生成abababab /** * Merges ...
删除两个字符串中的特定字符使其相等，统计删除的字符的ASCII和
为什么80%的码农都做不了架构师?>>> Minimum ASCII Delete Sum for Two Strings 问题: Given two strings s1, ...
php 字符串分割成两段,php 两个字符串分割合并的简单示例
搜索热词把两个字符串进行分割合并,例如str1=aaaa,str2=bbbb,合并后生成abababab,PHP分割合并两个字符串的函数,感兴趣的小伙伴,下面一起跟随编程之家 jb51.cc的小编来 ...
制作两个字符串字谜的最小步骤数
Prerequisite: 先决条件: Hashing data structure 散列数据结构 Problem statement: 问题陈述: Find the minimum number o ...
LeetCode刷题实战（43）:Multiply Strings
题目描述: 43 Multiply Strings 28.7% Medium Given two non-negative integers num1 and num2 represented as ...
查找两个字符串中相同字符串_使两个字符串相同的最低成本
查找两个字符串中相同字符串 Problem statement: 问题陈述: Given two strings string1 and string2 find the minimum cost r ...

LeetCode43——Multiply Strings（两个字符串表示的整数相乘）？？？

LeetCode43——Multiply Strings（两个字符串表示的整数相乘）？？？相关推荐

最新文章

热门文章