Given two non-negative numbers num1
and num2
represented as string, return the sum of num1
and num2
.
Note:
- The length of both
num1
andnum2
is < 5100. - Both
num1
andnum2
contains only digits0-9
. - Both
num1
andnum2
does not contain any leading zero. - You must not use any built-in BigInteger library or convert the inputs to integer directly.
这道题让我们求两个字符串的相加,之前LeetCode出过几道类似的题目,比如二进制数相加,还有链表相加,或是字符串加1,基本思路很类似,都是一位一位相加,然后算和算进位,最后根据进位情况看需不需要补一个高位,难度不大,参见代码如下:
class Solution { public: string addStrings(string num1, string num2) { string res = ""; int m = num1.size(), n = num2.size(), i = m - 1, j = n - 1, carry = 0; while (i >= 0 || j >= 0) { int a = i >= 0 ? num1[i--] - ‘0‘ : 0; int b = j >= 0 ? num2[j--] - ‘0‘ : 0; int sum = a + b + carry; res.insert(res.begin(), sum % 10 + ‘0‘); carry = sum / 10; } return carry ? "1" + res : res; } };
类似题目:
LeetCode All in One 题目讲解汇总(持续更新中...)
时间: 2024-09-30 14:16:17