将数组拆分成斐波那契序列

/*
 * 思路：
 * 1. 使用递归和Java Stream API进行斐波那契数列的查找。
 * 2. 尝试从字符串的每个位置开始分割，使用Stream检查每个片段是否符合条件。
 */
import java.util.ArrayList;
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class SolutionStream {
    public List<Integer> splitIntoFibonacci(String num) {
        List<Integer> result = new ArrayList<>();
        backtrack(num, result, 0);
        return result;
    }

    private boolean backtrack(String num, List<Integer> result, int index) {
        if (index == num.length() && result.size() >= 3) {
            return true;
        }
        return IntStream.range(index, num.length())
            .filter(i -> !(num.charAt(index) == '0' && i > index))
            .mapToObj(i -> num.substring(index, i + 1))
            .map(Long::parseLong)
            .filter(numL -> numL <= Integer.MAX_VALUE)
            .filter(numL -> {
                int size = result.size();
                return size <= 1 || numL == result.get(size - 1) + result.get(size - 2);
            })
            .anyMatch(numL -> {
                result.add(numL.intValue());
                boolean found = backtrack(num, result, index + String.valueOf(numL).length());
                if (!found) {
                    result.remove(result.size() - 1);
                }
                return found;
            });
    }
}