Additive Number -- leetcode

Additive number is a string whose digits can form additive sequence.

A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the sequence must be the sum of the preceding two.

For example:
"112358" is an additive number because the digits can form an additive sequence: 1, 1, 2, 3, 5, 8.

1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8

"199100199"  is also an additive number, the additive sequence is:  1, 99, 100, 199 .

1 + 99 = 100, 99 + 100 = 199

Note: Numbers in the additive sequence cannot have leading zeros, so sequence 1, 2, 03 or 1, 02, 3 is invalid.

Given a string containing only digits '0'-'9', write a function to determine if it's an additive number.

Follow up:
How would you handle overflow for very large input integers?

基本思路：

暴力偿试。

1. 对着字符串，任意2刀，得到3个子串。记为s1, s2, s3

2. 将s1, s2作整数加法，组成一个新子串sum。

3. 用sum与s3作匹配。

4. 如果完全匹配，则为一个additive number。

5. 如果为s3的前缀。则进行下一轮匹配：将s2,作为s1, 并将旧的s3，进行任意切断，得到新的s2, s3。重复步骤2~5.

优先化点为：

1. 当s1的长度超过整个字符串的一半时，则没必要进行偿试。因为，即使s2只占一个字符，那么s1+s2是到的sum的长度，也会超过剩余字符串s3的长度。

2. 当s2或者s1的长度超过s3的和度时，也没必要再继续进行偿试。因为s2+s1，长度一定会超过s3。

class Solution {
    string add(const string& num1, const string& num2) {
        string ans;
        auto iter1 = num1.rbegin();
        auto iter2 = num2.rbegin();
        int carry = 0;
        while (iter1 != num1.rend() || iter2 != num2.rend() || carry) {
            if (iter1 != num1.rend()) {
                carry += *iter1 - '0';
                ++iter1;
            }
            
            if (iter2 != num2.rend()) {
                carry += *iter2 - '0';
                ++iter2;
            }
            
            ans += carry % 10 + '0';
            carry /= 10;
        }
        return string(ans.rbegin(), ans.rend());
    }
    
    bool helper(const string& ppre, const string& pre, const string& num) {
        if (pre.size() > 1 && pre[0] == '0')
            return false;
        string sum = add(ppre, pre);
        if (num.compare(0, sum.size(), sum))
            return false;
        else if (sum.size() == num.size())
            return true;

        return helper(pre, sum, num.substr(sum.size()));
    }
    
public:
    bool isAdditiveNumber(string num) {
        for (int i=1; i<=num.size()/2; i++) {
            for (int j=i+1; max(i,j-i)<=(num.size()-j); j++) {
                if (helper(num.substr(0, i), num.substr(i, j-i), num.substr(j)))
                    return true;
            }
        }
        return false;
    }
};