题目
![](https://i-blog.csdnimg.cn/direct/c2ed126b5fbf4ed6ae146a87a5c19d94.png)
代码(首刷自解 2024年8月6日)
class Solution {
public:
string addStrings(string num1, string num2) {
// 倒着加
int flag = 0;
string res = "";
for (int i = num1.size() - 1, j = num2.size() - 1; i >= 0 || j >= 0 || flag > 0; i--, j--) {
// 进位的情况
int t1 = 0, t2 = 0;
if (i >= 0) t1 = num1[i] - '0';
if (j >= 0) t2 = num2[j] - '0';
int now = t1 + t2 + flag;
if (now >= 10) {
flag = 1;
char s1 = '0' + (now - 10);
res.insert(0, 1, s1);
} else {
flag = 0;
char s2 = '0' + now;
res.insert(0, 1, s2);
}
}
return res;
}
};