class Solution {
public:
string addStrings(string num1, string num2) {
int l1 = num1.length();
int l2 = num2.length();
string s;
int c=0,i=l1-1,j=l2-1,count=0;;
while(i>=0&&j>=0)
{
int current = (num1[i]-'0'+num2[j]-'0'+c)%10;
c = (num1[i]-'0'+num2[j]-'0'+c)/10;
s+= current+'0';
i--;
j--;
}
while(i>=0)
{
int current = (num1[i]-'0'+c)%10;
c = (num1[i]-'0'+c)/10;
s+= current+'0';
i--;
}
while(j>=0)
{
int current = (num2[j]-'0'+c)%10;
c = (num2[j]-'0'+c)/10;
s+= current+'0';
count++;
j--;
}
if(c>0)
s+=c+'0';
string res;
for(i=s.length()-1;i>=0;i--)
{
res+=s[i];
}
return res;
}
};