415. 字符串相加 - 力扣(LeetCode)https://leetcode.cn/problems/add-strings/
class Solution {
public:
string addStrings(string num1, string num2) {
int end1 = num1.size()-1, end2 = num2.size()-1, next = 0; // next 代表进位
string retstr;
while (end1 >= 0 || end2 >= 0) // 长的结束再结束
{
int val1 = end1 >= 0 ? num1[end1--] - '0' : 0;
int val2 = end2 >= 0 ? num2[end2--] - '0' : 0;
int ret = val1 + val2 + next;
next = ret / 10;
ret = ret % 10;
retstr.insert(retstr.begin(),'0'+ret);
}
if(next == 1)
retstr.insert(retstr.begin(),'1');
return retstr;
}
};