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.

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

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

Example 1:

Input: "112358"
Output: true 
Explanation: 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

Example 2:

Input: "199100199"
Output: true 
Explanation: The additive sequence is: 1, 99, 100, 199. 
             1 + 99 = 100, 99 + 100 = 199

/* 对string 划分得到一组数（至少三个 ） 满足a[i-2]+a[i-1]=a[i]
 * 当只能划分为大数时怎么办 ？
 * 程序分块：
 * 1. 大数加法 返回string
 * 2.递归判断 当前nums 拆成三段 A[0,i) B[i,j) C[j,len)
 *  A+B=sum  sum==C 达到了终点  不是的话 A.size()+B.size()>C.size() 明显不可能
 *                         否则 从C中进行划分 Cl[0, sum.size()), Cr[sum.size(), len)
 *                         递归判断B+Cl==Cr即可
 *  注意剪枝及特殊情况
 *
 * */
class Solution {
public:
    bool isAdditiveNumber(string num) {// 初始时切分为[0, i) [i, i+len) [j, numlen)
        int numlen=num.length();
        for(int i=1;i<=numlen/2;i++){
            for(int len=1;len<=(numlen-i)/2;len++){// i切一刀后j再切一刀保证两段的长度和不超过剩下一段 i+len<=numlen-()
                if(check(num.substr(0, i), num.substr(i, len), num.substr(i+len)))
                    return true;
            }
        }
        return false;
    }
    bool check(string num1, string num2, string sum){
        // 排除非法的值 即前导0（多余1位的情况  单个0不算）
        if((num1.size()>1 && num1[0]=='0') || (num2.size()>1 && num2[0]=='0'))  return false;
        string tmpsum = add(num1, num2);
        if(tmpsum == sum)   return true;
        int len = tmpsum.length();
        // 剪枝 tmpsum位数>= sum位数 没希望对sum划分 或者对sum划分的前面部分不为tmpsum也不行
        if(tmpsum.size()>=sum.size() || tmpsum.compare(sum.substr(0, len))!=0)  return false;
        // num1 num2 [sumleft sumright]  sumleft=tmpsum  接来下验证num2+sumleft==sumright
        return check(num2, tmpsum, sum.substr(len));

    }
    string add(const string &a, const string &b){// 大数加法
        string ret="";
        int i=a.size()-1, j=b.size()-1, carry=0;
        while(i>=0 || j>=0){// 一起循环 不用考虑一个先算完的问题
            int sum = carry + (i>=0 ? a[i--]-'0' : 0) + (j>=0 ? b[j--]-'0' : 0);
            ret.push_back(sum%10+'0');
            carry = sum/10;
        }
        if(carry)   ret.push_back(carry+'0');
        reverse(ret.begin(), ret.end());
        return ret;
    }
};