摘要：
class Solution: def permute(self, nums: List[int]) -> List[List[int]]: if len(nums) <= 1: return [nums] answer = [] for i, num in enumerate(nums): n = nums[:i] + nums[i+1:] for y in self.permute(n): a 阅读全文
摘要：
class Solution: def lenLongestFibSubseq(self, A: List[int]) -> int: s = set(A) n = len(A) result = 0 for i in range(n-1): for j in range(i+1, n): a, b = A[i], A[j] count = 2 while a+b in s: a, b = b, 阅读全文