實現兩個字串的乘法

實現兩個由數字構成的字串的乘法，其實現代碼如下所示：

#include<iostream>#include<string>#include<vector>using namespace std;string multiply(string &num1, string &num2){if (num1 == "0" || num2 == "0"){return "0";}int len1 = num1.length();int len2 = num2.length();vector<int> result(len1 + len2 - 1, 0);string resultStr = "";for (int i = len1 - 1; i >= 0; --i){for (int j = len2 - 1; j >= 0; --j){result[i + j] += (num1[i] - '0')*(num2[j] - '0');//關鍵的一步，兩個位元和相等的乘積放在同一個地方}}string temp1, temp2;int k = len1 + len2 - 2;while (k != 0){temp1 = result[k] % 10 + '0';resultStr = temp1 + resultStr;result[k - 1] += result[k] / 10;--k;}temp1 = result[0] % 10 + '0';resultStr = temp1 + resultStr;if (result[0] >= 10){temp2 = result[0] / 10 + '0';resultStr = temp2 + resultStr;}return resultStr;}int main(){string s1 = "9";string s2 = "9";string s3 = "12564875421475";string s4 = "4578124754157841541";cout << "s1*s2 = " << multiply(s1, s2) << endl;cout << "s3*s4 = " << multiply(s3, s4) << endl;system("pause");return 0;}

實驗結果如下所示：