nums=[1,2,3,4,6,8]
nums.sort()
dp = [[i] for i in nums]
# dp[1]=dp[1]+[nums[0]]
# dp
for i in range(len(nums)):
for j in range(i-1,-1,-1):
if nums[i] % nums[j] == 0:
if len(dp[j]) + 1 > len(dp[i]):#这步很关键
dp[i] = dp[j] + [nums[i]]
# res=max(dp, key=len)
# res
dp
nums=[1,2,3,4,6,8]
nums.sort()
dp = [[i] for i in nums]
# dp[1]=dp[1]+[nums[0]]
# dp
for i in range(len(nums)):
for j in range(0,i): #注意体会与上面的不同,主要是由于的下面if len(dp[j]) + 1 > len(dp[i])导致
if nums[i] % nums[j] == 0:
if len(dp[j]) + 1 > len(dp[i]):#这步很关键
dp[i] = dp[j] + [nums[i]]
# res=max(dp, key=len)
# res
dp