415 字符串相加(大数加法)
class Solution {
public:
string addStrings(string num1, string num2) {
int len1 = num1.size(), len2 = num2.size();
if (len1 < len2)
return addStrings(num2, num1);
// 将num1,num2反向存储,因为最高位放在数组末端,方便进位
vector<int> a, b;
for (int i = len1 - 1; i >= 0; i--)
a.push_back(num1[i] - '0');
for (int i = len2 - 1; i >= 0; i--)
b.push_back(num2[i] - '0');
string ans;
int t = 0;
for (int i = 0; i < len1; i++) {
t += a[i];
if (i < len2)
t += b[i];
ans.push_back(t % 10 + '0');
t /= 10;
}
if (t)
ans.push_back(t + '0');
// ans也为倒序,真实答案需要反过来
reverse(ans.begin(), ans.end());
return ans;
}
};