<p>Given two non-negative integers, <code>num1</code> and <code>num2</code> represented as string, return <em>the sum of</em> <code>num1</code> <em>and</em> <code>num2</code> <em>as a string</em>.</p>

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

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> num1 = &quot;11&quot;, num2 = &quot;123&quot;
<strong>Output:</strong> &quot;134&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> num1 = &quot;456&quot;, num2 = &quot;77&quot;
<strong>Output:</strong> &quot;533&quot;
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> num1 = &quot;0&quot;, num2 = &quot;0&quot;
<strong>Output:</strong> &quot;0&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= num1.length, num2.length &lt;= 10<sup>4</sup></code></li>
	<li><code>num1</code> and <code>num2</code> consist of only digits.</li>
	<li><code>num1</code> and <code>num2</code> don&#39;t have any leading zeros except for the zero itself.</li>
</ul>

class Solution {
public:
    string addStrings(string num1, string num2) {
        string ans = "";
        int i = num1.size()-1;
        int j = num2.size()-1;
        int carry = 0;
        while(i >=0 && j>=0){
            int a = num1[i] - '0';
            int b = num2[j] - '0';
            int add = a+b+carry;
            i--;
            j--;
            if(add>=10){
                carry = add/10;
                ans=ans+ to_string(add%10);
            } else {
                ans+=to_string(add);
                carry = 0;
            }
        }
        while(i>=0){
            int a = num1[i] - '0';
            int add = a+carry;
            i--;
            if(add>=10){
                carry = add/10;
                ans=ans+ to_string(add%10);
            } else {
                ans+=to_string(add);
                carry = 0;
            }
        }
        while(j>=0){
            int a = num2[j] - '0';
            int add = a+carry;
            j--;
            if(add>=10){
                carry = add/10;
                ans=ans+ to_string(add%10);
            } else {
                ans+=to_string(add);
                carry = 0;
            }
        }
        if(carry>0){
            ans+=to_string(carry);
        }
        reverse(ans.begin(),ans.end());
        return ans;
    }
};
39791