LeetCode 842 Split Array into Fibonacci Sequence

LeetCode 842 Split Array into Fibonacci Sequence

传送门

题目分析

Given a string S of digits, such as S = "123456579", we can split it into a Fibonacci-like sequence [123, 456, 579].

Formally, a Fibonacci-like sequence is a list F of non-negative integers such that:

• 0 <= F[i] <= 2^31 - 1, (that is, each integer fits a 32-bit signed integer type);
• F.length >= 3;
• andF[i] + F[i+1] = F[i+2]for all 0 <= i < F.length - 2.

Also, note that when splitting the string into pieces, each piece must not have extra leading zeroes, except if the piece is the number 0 itself.

Return any Fibonacci-like sequence split from S, or return [] if it cannot be done.

Example 1:

Input: "123456579"
Output: [123,456,579]

Example 2:

Input: "11235813"
Output: [1,1,2,3,5,8,13]

Example 3:

Input: "112358130"
Output: []
Explanation: The task is impossible.

Example 4:

Input: "0123"
Output: []
Explanation: Leading zeroes are not allowed, so "01", "2", "3" is not valid.

Example 5:

Input: "1101111"
Output: [110, 1, 111]
Explanation: The output [11, 0, 11, 11] would also be accepted.

Note:

1. 1 <= S.length <= 200
2. S contains only digits.

给定一个数字字符串，将其拆分为类似斐波那契数列的数组。

思路

典型的回溯法，首先确定前两个数字，数字由于不大于$2^{31}-1$，因此长度最大就是11位左右，使用stoll判断数字是否过大，不过大进入递归，否则返回结果vector，递归结束条件为字符串全部相等或者不满足继续的条件。

代码实现

class Solution {
    bool dp(string S, string has, int one, int two, vector<int> &result) {
        string new_str = has + to_string(one + two);
        // 长度关系
        if (S.length() < new_str.length()) {
            return false;
        }
        else if (S == new_str) {
            // 回溯结束
            result.push_back(one + two);
            return true;
        }
        // 存在于首位
        if (S.find(new_str) == 0) {
            result.push_back(one + two);
            return dp(S, new_str, two, one + two, result));
        }
        return false;
    }
public:
    vector<int> splitIntoFibonacci(string S) {
        // 查看S能否分成fibonacci-like的数组
        // 进行尝试，首先确定前两个数字，必须最少3个数字
        std::vector<int> result;
        result.clear();
        for (int i = 1; i < S.length() && i < 13; ++i) {
            for (int j = i + 1; j < S.length() && j - i < 13; ++j) {
                if (stoll(S.substr(0, i)) > INT_MAX || stoll(S.substr(i, j - i)) > INT_MAX) {
                    break;
                }
                result.push_back(stoi(S.substr(0, i)));
                result.push_back(stoi(S.substr(i, j - i)));
                // 前导0问题
                if (dp(S, to_string(result[0]) + to_string(result[1]), result[0], result[1], result)) {
                    return result;
                }
                else {
                    result.clear();
                }
            }
        }
        return result;
    }
};

感想

回溯法的一般思路。