Leetcode: Additive Number

最新推荐文章于 2024-11-08 23:27:36 发布

YMHH

最新推荐文章于 2024-11-08 23:27:36 发布

阅读量362

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/ymhhym/article/details/50413138

版权

Leetcode 专栏收录该内容

249 篇文章 0 订阅

订阅专栏

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.

看上去比较复杂，以为需要DP之类的；尝试了写写，发现回溯+递归可以通过。不过0这个处理细节需要各种注意。

class Solution {
public:
    bool isAdditiveNumber(string num) {
        if (num.size() < 3) {
            return false;
        }
        
        int numVal1 = 0;
        for (int iLen = 1; iLen < num.size() - iLen; ++iLen) {
            numVal1 = numVal1 * 10 + num[iLen - 1] - '0';
            int numVal2 = 0;
            for (int jLen = 1; jLen <= num.size() - iLen - max(iLen, jLen); ++jLen) {
                numVal2 = numVal2 * 10 + num[iLen + jLen - 1] - '0';
                if (isAdditiveNumberHelper(num, iLen + jLen, max(iLen, jLen), numVal1, numVal2)) {
                    return true;
                }
                if (numVal2 == 0) {
                    break;
                }
            }
            if (numVal1 == 0) {
                break;
            }
        }
        
        return false;
    }
    
    bool isAdditiveNumberHelper(const string& numStr, int start, int len, int numVal1, int numVal2) {
        int orgLen = len;
        int numVal = 0;
        int i = start;
        for (; i < numStr.size() && len-- > 0; ++i) {
            numVal = numVal * 10 + numStr[i] - '0';
        }
        int numSum = numVal1 + numVal2;
        if (numVal < numSum && i < numStr.size() && numStr[start] != '0') {
            numVal = numVal * 10 + numStr[i++] - '0';
            ++orgLen;
        }
        
        if (numSum == numVal) {
            if (i == numStr.size()) {
                return true;
            }
            numVal1 = numVal2;
            numVal2 = numVal;
            return isAdditiveNumberHelper(numStr, i, orgLen, numVal1, numVal2);
        }
        
        return false;
    }
};