[leetcode] 43. Multiply Strings

[leetcode] 43. Multiply Strings

Description

Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.

Example 1:

Input: num1 = "2", num2 = "3"Output: "6"

Example 2:

Input: num1 = "123", num2 = "456"Output: "56088"

Note:

The length of both num1 and num2 is < 110.Both num1 and num2 contain only digits 0-9.Both num1 and num2 do not contain any leading zero, except the number 0 itself.You must not use any built-in BigInteger library or convert the inputs to integer directly.

分析

题目的意思是：求两个数字字符串的乘积。

把错位相加后的结果保存到一个一维数组中，然后分别在每位上算进位，最后每个数字都变成一位，然后要做的是去除掉首位0，最后把每位上的数字按顺序保存到结果中即可

代码

class Solution {public: string multiply(string num1, string num2) { string res=""; int m=num1.size(); int n=num2.size(); vector v(m+n,0); int k=m+n-2; for(int i=0;i=0) res.push_back(v[i--]+'0'); return res; }};

参考文献

​​[编程题]multiply-strings​​​​[LeetCode] Multiply Strings 字符串相乘​​

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。