306. Additive Number

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?

s思路:
1. 例如：”199100199” ，先找到１，然后找到９，1+9=10没找到，那么９就不行，继续尝试９９，１＋９９＝１００，找到了，然后把１００作为新的数，把９９作为旧的数，然后继续尝试，９９＋１００=199，也找到了，而且所有数都遍历完了，因此返回true.
2. 仔细观察整个过程，就是用双重for找到起始的两个相加的数，然后用一个checker去检查起始两个数相加是否等于或部分等于substr()，而这个checker本身是一个recursive的过程。所以说这个题就是两个for+recursive的过程。同时注意由于两个数相加和的长度大于等于加数长度。
3. 关于如何处理加法的数很大的问题，那就用string加法好了，单写一个函数做加法。string加法之前有一道一样的题，就是从右边往左加，然后结果reverse。

//方法１：MLE，不知道为什么，不过确实没有后面的写得清楚
class Solution {
public:
    string sum(string str1,string str2){
        string res;
        int carry=0;
        reverse(str1.begin(),str1.end());
        reverse(str2.begin(),str2.end());       
        int i=0;
        while(i<min(str1.size(),str2.size())||carry==1){
            int cur=(i<str1.size()?(str1[i]-'0'):0)+i<str2.size()?(str2[i]-'0'):0)+carry;
            res+=char(cur%10+'0');
            carry=cur/10;
        }
        return vector<int>(res.rbegin(),res.rend());
    }

    bool helper(string&num,int start1,int end1,int end2){
        //

        if(end2==num.size()-1) return true;
        string str1=num.substr(start1,end1-start1+1);
        string str2=num.substr(end1+1,end2-end1);
        string res=sum(str1,str2);
        if(res.size()<num.size()-end2-1||res!=num.substr(end2+1,res.size())) return false;
        return helper(num,end1+1,end2,end2+res.size());

    }   

    bool isAdditiveNumber(string num) {
        //
        for(int i=0;i<num.size();i++){ 
            for(int j=i+1;j<num.size();j++){
                if(helper(num,0,i,j)) return true;      
            }
        }
        return false;
    }
};


//方法２:不用传递坐标，居然就没有MLE，费解！
class Solution {
public:
    string adder(string num1, string num2){
        string res;
        int i=num1.size()-1,j=num2.size()-1,carry=0;
        while(i>=0||j>=0){
            carry+=(i>=0?(num1[i--]-'0'):0)+(j>=0?(num2[j--]-'0'):0);
            res.push_back(carry%10+'0');
            carry=carry/10;
        }
        if(carry) res.push_back(carry%10+'0');
        reverse(res.begin(),res.end());
        return res;
    }


    bool helper(string num1,string num2,string numsum){
        //

        if(num1.size()>1&&num1[0]=='0'||num2.size()>1&&num2[0]=='0') return false;

        string res=adder(num1,num2);
        if(res==numsum) return true;
        if(res.size()>=numsum.size()||res.compare(numsum.substr(0,res.size()))!=0) return false;
        return helper(num2,res,numsum.substr(res.size()));

    }   

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