leetcode之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.

解答:

很标准的枚举,注意要判断是不是有前置0,同时在加法的时候用字符串加法,防止数字过大的时候溢出

class Solution {
public:
    string add(string a,string b)
    {
        int lena = a.length();
        int lenb = b.length();
        string res = "";
        reverse(a.begin(),a.end());
        reverse(b.begin(),b.end());
        int len = min(lena, lenb);
        int carry = 0;
        int pos = 0;
        while(pos < len)
        {
            int t = (carry + (a[pos] - '0') + (b[pos] - '0'));
            res = res + char('0' + (t % 10));
            carry = t / 10;
            pos++;
        }
        while(pos < lena)
        {
            int t = (carry + a[pos] - '0');
            res = res + char('0' + (t % 10));
            carry = t / 10;
            pos++;
        }
        while(pos < lenb)
        {
            int t = (carry + b[pos] - '0');
            res = res + char('0' + (t % 10));
            carry = t / 10;
            pos++;
        }
        if(carry)
            res = res + char('0' + carry);
        reverse(res.begin(),res.end());
        return res;
    }
    
    bool DFS(int start, string &str,string str1,string str2)
    {
        if(start == str.length())
            return true;
        if (str1[0] == '0' && str1.length() > 1)
			return false;
		if (str2[0] == '0' && str2.length() > 1)
			return false;
        string tmp = add(str1,str2);
        if(start + tmp.length() > str.length())
            return false;
        if(tmp == str.substr(start,tmp.length()))
            return DFS(start + tmp.length(),str,str2,str.substr(start,tmp.length()));
        else
            return false;
    }
    bool isAdditiveNumber(string num) {
        int len = num.length();
        if(len < 3) 
            return false;
        bool res = false;
        for(int i = 0; i < len - 2;++i)
        {
            for(int j = i + 1;j < len - 1; ++j)
            {
                res = res || DFS(j + 1, num, num.substr(0,i + 1),num.substr(i + 1, j - i));
            }
        }
        return res;
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值