Split Array into Fibonacci Sequence

最新推荐文章于 2020-06-04 15:07:56 发布

原创最新推荐文章于 2020-06-04 15:07:56 发布 · 365 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #C #回溯

=====LeetCode===== 同时被 2 个专栏收录

115 篇文章

订阅专栏

LeetCode之回溯

15 篇文章

订阅专栏

本文介绍了一种算法，用于将给定的数字字符串拆分为满足斐波那契数列特性的序列。通过递归方法检查所有可能的分割方式，确保每个数字不超过32位整数的范围，并且不包含前导零。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述：

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

Formally, a Fibonacci-like sequence is a list F of non-negative integers such that:
1.0 <= F[i] <= 2^31 - 1, (that is, each integer fits a 32-bit signed integer type);
2.F.length >= 3;
3.and F[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.

思路:这道题完全和Additive Number一样，不过在截取数字的时候要注意题目中对斐波那契数的范围要求。

#include<cstdio>
#include<string>
#include<vector>
#include<stdlib.h>
using namespace std;

bool split(string S,vector<int>& nums,int count,int start)
{
	if(count==S.length())
	{
		if(nums.size()>2)	
	        return true;		    
		else
		    return false;
	}
	else
	{ 
		for(int i=1;i+start<=S.length();i++)
		{
			int number = atoi(S.substr(start,i).c_str());
			//防止分隔成的数超过int的最大值 
			if(number<0)
			    return false;
			//分割成的数字不能以0开头 
			if(number!=0&&atoi(S.substr(start,1).c_str())==0)
			    return false;    
			if(nums.size()>=2)
			{
				int num1 = nums[nums.size()-1];
				int num2 = nums[nums.size()-2];				
				if(number!=num1+num2)
					continue;
			}    		
			nums.push_back(number);
			if(split(S,nums,count+i,start+i))
			    return true;
			nums.pop_back();
		}
		return false;		
	}
}
vector<int> splitIntoFibonacci(string S) 
{
	vector<int> result;
	if(S.length()<3)
	    return result;
	split(S,result,0,0);    
	return result;		        
}

int main(){
	string S = "214748364721474836422147483641";
	vector<int> result = splitIntoFibonacci(S);
	printf("size()=%d\n",result.size());
	for(int i=0;i<result.size();i++)
	    printf("%d ",result[i]);
	printf("\n");    
	return 0;
}