Length of Longest Fibonacci Subsequence

[leetcode]Length of Longest Fibonacci Subsequence

链接：https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/description/

Question

A sequence X_1, X_2, ..., X_n is fibonacci-like if:

• n >= 3
• X_i + X_{i+1} = X_{i+2} for all i + 2 <= n

Given a strictly increasing array A of positive integers forming a sequence, find the length of the longest fibonacci-like subsequence of A. If one does not exist, return 0.

(Recall that a subsequence is derived from another sequence A by deleting any number of elements (including none) from A, without changing the order of the remaining elements. For example, [3, 5, 8] is a subsequence of [3, 4, 5, 6, 7, 8].)

Example 1

Input: [1,2,3,4,5,6,7,8]
Output: 5
Explanation:
The longest subsequence that is fibonacci-like: [1,2,3,5,8].

Example 2

Input: [1,3,7,11,12,14,18]
Output: 3
Explanation:
The longest subsequence that is fibonacci-like:
[1,11,12], [3,11,14] or [7,11,18].

3 <= A.length <= 1000
1 <= A[0] < A[1] < ... < A[A.length - 1] <= 10^9
(The time limit has been reduced by 50% for submissions in Java, C, and C++.)

Solution

class Solution {
public:
  int lenLongestFibSubseq(vector<int>& A) {
    unordered_map<int, int> mp;
    int size = A.size();
    for (int i = 0; i < size; i++) mp[A[i]] = i;
    // dp[i][j]表示A[i]和A[j]构成Fibonacci Subsequence的最长链长度
    vector<vector<int> > dp;
    dp.resize(size);
    for (int i = 0; i < size; i++) dp[i].resize(size);

    int max_value = 0;
    for (int j = 1; j < size; j++) dp[0][j] = 2;
    // dp[i][j]的状态转移是diff=A[j]-A[i]到A[i]构成Fibonacci Subsequence的最长链长度+1
    for (int i = 1; i < size; i++) {
      for (int j = i+1; j < size; j++) {
        int diff = A[j]-A[i];
        if (mp.find(diff) != mp.end() && mp[diff] < i) {
          int index = mp[diff];
          dp[i][j] = dp[index][i]+1;
          max_value = max(max_value, dp[i][j]);
        } else {
          dp[i][j] = 2;
        }
      }
    }
    return max_value;
  }
};

int main(int argc, char const *argv[]) {
  vector<int> A = {1,2,3};
  Solution s;
  cout << s.lenLongestFibSubseq(A) << endl;
  return 0;
}

思路：将将两个数以索引的形式保存在dp数组中，每次只要找到上一对Fibonacci Subsequence再加一就可以了。