Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.
Note:
- The length of both num1 and num2 is < 5100.
- Both num1 and num2 contains only digits 0-9.
- Both num1 and num2 does not contain any leading zero.
- You must not use any built-in BigInteger library or convert the inputs to integer directly.
class Solution {
public:
string addStrings(string num1, string num2) {
string ans;
int c = 0, i, j;
for(i = num1.length() - 1, j = num2.length() - 1; i >= 0 && j >= 0; --i, --j){
int s = (num1[i] - '0') + (num2[j] - '0') + c;
ans.push_back(s % 10 + '0');
c = s / 10;
}
while(i >= 0){
int s = (num1[i] - '0') + c;
ans.push_back(s % 10 + '0');
c = s / 10;
--i;
}
while(j >= 0){
int s = (num2[j] - '0') + c;
ans.push_back(s % 10 + '0');
c = s / 10;
--j;
}
if(c) ans.push_back(c + '0');
reverse(ans.begin(), ans.end());
return ans;
}
};