题目描述
如果序列 X_1, X_2, …, X_n 满足下列条件,就说它是 斐波那契式 的:
- n >= 3
- 对于所有 i + 2 <= n,都有 X_i + X_{i+1} = X_{i+2}
给定一个严格递增的正整数数组形成序列,找到 A 中最长的斐波那契式的子序列的长度。如果一个不存在,返回 0 。
(回想一下,子序列是从原序列 A 中派生出来的,它从 A 中删掉任意数量的元素(也可以不删),而不改变其余元素的顺序。例如, [3, 5, 8] 是 [3, 4, 5, 6, 7, 8] 的一个子序列)
示例:
输入: [1,2,3,4,5,6,7,8]
输出: 5
解释:
最长的斐波那契式子序列为:[1,2,3,5,8] 。
动态规划
class Solution {
public int lenLongestFibSubseq(int[] A) {
int N = A.length;
Map<Integer, Integer> idx = new HashMap<>();
for(int i = 0; i < N; i++)
idx.put(A[i], i);
Map<Integer, Integer> longest = new HashMap<>();
int res = 0;
for(int i = 2; i < N; i++) {
for(int j = 1; j < i; j++) {
int k = idx.getOrDefault(A[i]-A[j], -1);
if(k >= 0 && k < j) {
int tmp = longest.getOrDefault(k*N+j, 2)+1;
longest.put(j*N+i, tmp);
res = Math.max(res, tmp);
}
}
}
return res;
}
}
“非递归”
class Solution {
public int lenLongestFibSubseq(int[] A) {
int N = A.length;
int res = 0;
for(int i = 0; i < N-2; i++) {
// int pos = i+2;
for(int j = i+1; j < N-1; j++) {
int pos = j+1;
int sum = A[i]+A[j];
while(pos < N && A[pos] < sum)
pos++;
if(pos == N) return res;
if(A[pos] != sum) continue;
int b = sum, c = A[j]+b, curL = 3, k = pos+1;
while(true) {
while(k < N && A[k] < c)
k++;
if(k == N) break;
if(A[k] != c) break;
curL++;
c = b + c;
b = c - b;
}
res = Math.max(res, curL);
}
}
return res;
}
}
Set暴力法
class Solution {
public int lenLongestFibSubseq(int[] A) {
int N = A.length;
Set<Integer> S = new HashSet();
for (int x: A) S.add(x);
int ans = 0;
for (int i = 0; i < N; ++i)
for (int j = i+1; j < N; ++j) {
/* With the starting pair (A[i], A[j]),
* y represents the future expected value in
* the fibonacci subsequence, and x represents
* the most current value found. */
int x = A[j], y = A[i] + A[j];
int length = 2;
while (S.contains(y)) {
// x, y -> y, x+y
int tmp = y;
y += x;
x = tmp;
ans = Math.max(ans, ++length);
}
}
return ans;
}
}
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/length-of-longest-fibonacci-subsequence
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。