Additive Number | Leetcode

原创 2015年11月18日 19:43:35

Additive number is a positive integer 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 represents an integer, write a function to determine if it's an additive number.

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

Credits:
Special thanks to @jeantimex for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

使用深度搜索,可以很容易解决这道题,代码如下,为了防止越界,需要使用long类型来存储中间值。构建一个辅助函数进行递归判断,传入每次的前两个数,如果后面的数值不论是最小还是最大,都不能等于传入值的和,那么说前一步的取数方式是错误的,需要重新取。

主函数中就是枚举第一次的两个输入。参考代码如下:

{CSDN:CODE:class Solution {
public:
//dfs
    bool isAdditiveNumber(string num) {
        //return isAdditiveHelper(num,10,1,2147483647,0);
        if(num.length()<3)
            return false;
        int step=0;
        //防止越界
        long front=0,second=0;
        for(int i=0;i<num.length()-1;){
            front=front*10+num[i]-'0';
            int j=i+1;
            second=0;
            for(;j<num.length();){
                if(j==i+1&&num[j]=='0'){
                    second=0;
                    if(isAdditiveHelper(num,j,front,second,0))
                        return true;
                    else
                        break;
                }else{
                    second=second*10+num[j]-'0';
                    if(isAdditiveHelper(num,j,front,second,0))
                        return true;
                    ++j;
                }
            }
            ++i;
        }
        return false;
    }
    
    bool isAdditiveHelper(string num,int step,long front,long second,int depth){
        if(depth==0&&step==num.length()-1)
            return false;
        else if(depth>0&&step==num.length()-1){
            return true;
        }
        string temp=num.substr(step+1,num.length()-step-1);
        long result_should=front+second;
        long res_get=0;
        int i=0;
        for(;i<temp.length();){
            if(i==0&&temp[i]=='0'){
                return false;
            }
            res_get=res_get*10+temp[i]-'0';
            if(res_get>result_should)
                return false;
            else if(res_get==result_should){
                return isAdditiveHelper(num,i+step+1,second,result_should,depth+1);
            }
            ++i;
        }
        return false;
    }
};}


版权声明:本文为博主原创文章,未经博主允许不得转载。

[LeetCode306] Additive Number

Additive number is a string whose digits can form additive sequence. A valid additive sequence sh...
  • sbitswc
  • sbitswc
  • 2015年12月06日 03:56
  • 2840

LeetCode306——Additive Number且看我是如何解决的

Additive number is a string whose digits can form additive sequence. A valid additive sequence sh...
  • booirror
  • booirror
  • 2015年12月05日 22:23
  • 1636

【Leetcode】Additive Number

题目链接:https://leetcode.com/problems/additive-number/ 题目: Additive number is a string whose digits...
  • yeqiuzs
  • yeqiuzs
  • 2016年07月12日 13:49
  • 562

[leetcode] 306. Additive Number

题目: Additive number is a string whose digits can form additive sequence.A valid additive sequence s...
  • u014673347
  • u014673347
  • 2016年02月21日 11:29
  • 682

LeetCode(306) Additive Number

题目Additive number is a string whose digits can form additive sequence.A valid additive sequence shou...
  • fly_yr
  • fly_yr
  • 2015年12月12日 16:56
  • 1972

LeetCode:306. Additive Number

原题: Additive number is a string whose digits can form additive sequence. A valid additive sequence...
  • x_i_y_u_e
  • x_i_y_u_e
  • 2016年02月23日 16:53
  • 1193

[LeetCode]Additive Number

题目链接:Additive Number题目内容:Additive number is a positive integer whose digits can form additive sequen...
  • xyt8023y
  • xyt8023y
  • 2015年11月23日 14:34
  • 1498

306. Additive Number LeetCode

题意:给出一个只包含数字的字符串,问是否可以分成至少3个数,前两个数相加等于第三个数。 题解:枚举前两项,有了前两项就可以递推出后面的值,然后递推到跟原字符串长度相等的时候停止,然后比较是否相等,相...
  • youthinkwu
  • youthinkwu
  • 2016年03月16日 17:56
  • 220

LeetCode 306 Additive Number

Additive number is a string whose digits can form additive sequence. A valid additive sequence shou...
  • niuooniuoo
  • niuooniuoo
  • 2016年05月18日 11:03
  • 390

【LeetCode】306. Additive Number

题目描述: Additive number is a string whose digits can form additive sequence. A valid additive sequenc...
  • MapleJam
  • MapleJam
  • 2016年10月18日 08:42
  • 119
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Additive Number | Leetcode
举报原因:
原因补充:

(最多只允许输入30个字)