873. Length of Longest Fibonacci Subsequence

最新推荐文章于 2021-01-12 11:50:35 发布

ForABiggerWorld

最新推荐文章于 2021-01-12 11:50:35 发布

阅读量705

点赞数

分类专栏： leetcode hashtable

本文链接：https://blog.csdn.net/zjucor/article/details/81153493

版权

leetcode 同时被 3 个专栏收录

558 篇文章 0 订阅

订阅专栏

87 篇文章 0 订阅

订阅专栏

hashtable

15 篇文章 0 订阅

订阅专栏

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].

Note:

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++.)

最开始2个数给定了，后续就确定了，直接暴力放到set里面+循环

class Solution:
    def lenLongestFibSubseq(self, A):
        """
        :type A: List[int]
        :rtype: int
        """
        s=set(A)
        ma = 0
        for i in range(len(A)):
            for j in range(i+1,len(A)):
                a, b = A[i],A[j]
                t = 2
                while a+b in s:
                    a,b = b,a+b
                    t+=1
                if t>=3: ma=max(ma,t)
        return ma

或者用DP，用前面2个数作为Key来cache，貌似斐波那契之类的问题都有类似的解法？

class Solution:
    def lenLongestFibSubseq(self, a):
        """
        :type A: List[int]
        :rtype: int
        """
        dp = {}
        s=set(a)
        for i in range(len(a)):
            for j in range(i):
                dp[(a[j],a[i])]=2
                if a[i]-a[j] in s and (a[i]-a[j],a[j]) in dp:
                    dp[(a[j],a[i])]=dp[(a[i]-a[j],a[j])]+1
        
        res=max(dp.values())
        return res if res>2 else 0