g0801_0900.s0873_length_of_longest_fibonacci_subsequence.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0801_0900.s0873_length_of_longest_fibonacci_subsequence;
// #Medium #Array #Hash_Table #Dynamic_Programming
// #2022_03_28_Time_120_ms_(92.64%)_Space_115.6_MB_(63.42%)
public class Solution {
public int lenLongestFibSubseq(int[] arr) {
if (arr == null || arr.length < 3) {
return 0;
}
int len = arr.length;
int[][] dp = new int[len][len];
int ans = 0;
for (int i = 2; i < len; i++) {
int left = 0;
int right = i - 1;
while (left < right) {
if (arr[left] + arr[right] < arr[i]) {
left++;
} else if (arr[left] + arr[right] > arr[i]) {
right--;
} else {
// dp[right][i] = Math.max(dp[right][i], dp[left][right] + 1);
dp[right][i] = dp[left][right] + 1;
ans = Math.max(ans, dp[right][i]);
left++;
right--;
}
}
}
return ans > 0 ? ans + 2 : 0;
}
}