Split Array into Fibonacci Sequence

最新推荐文章于 2020-12-08 11:58:54 发布

Charles-Liu

最新推荐文章于 2020-12-08 11:58:54 发布

阅读量213

点赞数

分类专栏： leetcode 回溯递归

本文链接：https://blog.csdn.net/perdon123123/article/details/81675637

版权

leetcode 同时被 3 个专栏收录

86 篇文章 0 订阅

订阅专栏

递归

13 篇文章 0 订阅

订阅专栏

回溯

10 篇文章 0 订阅

订阅专栏

[leetcode]Split Array into Fibonacci Sequence

链接：https://leetcode.com/problems/split-array-into-fibonacci-sequence/description/

Question

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 <= S.length <= 200
S contains only digits.

Solution

class Solution {
public:
  vector<int> res;
  string str;
  int size;
  bool flag = false;
  void dfs(int index, vector<int> ans) {
    if (flag == true) return;
    if (index == size && ans.size() >= 3) {
      flag = true;
      res = ans;
      return;
    }
    for (int gap = 1; gap <= size-index; gap++) {
      string temp = str.substr(index, gap);
      if (temp[0] == '0' && temp.size() > 1) break;
      int temp_i = atoi(temp.c_str());
      if (temp_i < 0 || temp_i > ((1 << 31)-1)) break;
      if (ans.size() <= 1) {
        ans.push_back(temp_i);
        dfs(index+gap, ans);
        ans.pop_back();
      } else {
        int last_one = ans[ans.size()-1];
        int last_two = ans[ans.size()-2];
        if (last_one+last_two == temp_i) {
          ans.push_back(temp_i);
          dfs(index+gap, ans);
          ans.pop_back();
        } else if (last_one+last_two > temp_i) {
          continue;
        } else { // 后面肯定也不满足
          break;
        }
      }
    }
  }

  vector<int> splitIntoFibonacci(string S) {
    this->str = S;
    this->size = str.size();
    dfs(0, vector<int>());
    if (flag == false) res = vector<int>();
    return res;
  }
};