LeetCode 415. Add Strings

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

Note:

1. The length of both num1 and num2 is < 5100.
2. Both num1 and num2 contains only digits 0-9.
3. Both num1 and num2 does not contain any leading zero.
4. 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) {
        int len1 = num1.size();
        int len2 = num2.size();
        int len = max(len1, len2);
        string result(len, '0');
        int carry = 0;
        while (len > 0) {
            int sum = carry;
            if (len1 > 0) {
                sum += num1[--len1] - '0';
            }
            if (len2 > 0) {
                sum += num2[--len2] - '0';
            }
            result[--len] = sum % 10 + '0';
            carry = sum / 10;
        }
        return carry == 0? result: '1' + result;
    }
};