Leetcode 873. 最长的斐波那契子序列的长度

每日打卡

思路 ：动态规划+hash表

class Solution:
    def lenLongestFibSubseq(self, arr: [int]) -> int:
        max_len = 0
        sum_dict = {}
        for i in range(2, len(arr)):
            l, r = 0, i - 1
            while l < r:
                if arr[l] + arr[r] == arr[i]:
                    p = (arr[l], arr[r])
                    p2 = (arr[r], arr[i])
                    curr_max_len = max(sum_dict.get(p, 0) + 1, sum_dict.get(p2, 0) )
                    sum_dict[p2] = curr_max_len
                    max_len = max(curr_max_len + 2, max_len)
                    l += 1
                    r -= 1
                elif arr[l] + arr[r] > arr[i]:
                    r -= 1
                else:
                    l += 1
        return max_len

参考：后期补上