415.字符串相加

Given two non-negative integers, num1 and num2 represented as string, return the sum of num1 and num2 as a string.

You must solve the problem without using any built-in library for handling large integers (such as BigInteger). You must also not convert the inputs to integers directly.

Example 1:

Input: num1 = “11”, num2 = “123”
Output: “134”
Example 2:

Input: num1 = “456”, num2 = “77”
Output: “533”
Example 3:

Input: num1 = “0”, num2 = “0”
Output: “0”

Constraints:

1 <= num1.length, num2.length <= 104
num1 and num2 consist of only digits.
num1 and num2 don’t have any leading zeros except for the zero itself.

class Solution {
public:
    string addStrings(string num1, string num2) {
        int p1=num1.size(),p2=num2.size();
        char res;
        string sum;
        int carry=0;

        while(p1!=0&&p2!=0)
        {
            p1-=1;
            p2-=1;

            res=num1[p1]+num2[p2]+carry-2*'0';
            carry=res/10;
            res%=10;            
            sum.push_back(res+'0');
            //sum.insert(0,1,res+'0');
        }
        if(p1==0)
        {
            while(p2!=0)
            {
                p2-=1;
                res=num2[p2]+carry-'0';
                carry=res/10;
                res%=10;
                sum.push_back(res+'0');
                //sum.insert(0,1,res+'0');
            }
        }
        if(p2==0)
        {
            while(p1!=0)
            {
                p1-=1;
                res=num1[p1]+carry-'0';
                carry=res/10;
                res%=10;                
                sum.push_back(res+'0');
                //sum.insert(0,1,res+'0');
            }
        }
        if(carry!=0)
        {
            sum.push_back(carry+'0');
            //sum.insert(0,1,carry+'0');
        }
        reverse(sum.begin(),sum.end());
        return sum;
    }
};