LeetCode #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.

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

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

任取字符串的前两段子字符串计算和，判断是否能和字符串的第三段匹配，如果可以匹配就接着计算子字符串和，经过不断循环得到最终的字符串和原字符串比较即可。

class Solution {
public:
    bool isAdditiveNumber(string num) {
        for(int i=1;i<num.size();i++)
        {
            for(int j=i+1;j<num.size();j++)
            {
                string s1=num.substr(0,i);
                string s2=num.substr(i,j-i);
                if((s1.size()>1&&s1[0]=='0')||(s2.size()>1&&s2[0]=='0')) continue;
                long long sum=atoll(s1.c_str())+atoll(s2.c_str());
                string s3=to_string(sum);
                if(s3!=num.substr(j,s3.size())) continue;
                
                string temp=s1+s2+s3;
                while(temp.size()<num.size())
                {
                    s1=s2;
                    s2=s3;
                    sum=atoi(s1.c_str())+atoi(s2.c_str());
                    s3=to_string(sum);
                    temp+=s3;
                }
                if(temp==num) return true;
            }
        }
        return false;
    }
};