【leetcode】368. Largest Divisible Subset【M】【65】

最新推荐文章于 2022-05-04 08:34:24 发布

sscssz

最新推荐文章于 2022-05-04 08:34:24 发布

阅读量412

点赞数

分类专栏： leetcode Python 算法 DP 文章标签： leetcode leetcode题解动态规划 python

本文链接：https://blog.csdn.net/sscssz/article/details/51821068

版权

Python 同时被 3 个专栏收录

176 篇文章 0 订阅

订阅专栏

leetcode

175 篇文章 0 订阅

订阅专栏

算法

157 篇文章 0 订阅

订阅专栏

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0.

If there are multiple solutions, return any subset is fine.

Example 1:

nums: [1,2,3]

Result: [1,2] (of course, [1,3] will also be ok)

Example 2:

nums: [1,2,4,8]

Result: [1,2,4,8]

Credits:
Special thanks to @Stomach_ache for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

动态规划

首先对数组进行排序，这样保证小的在前面

地推公式是

dp[i] = max{dp[j] + t[j]}, j < i

t[j] = 1, if nums[i] %nums[j]

0 ,else

然后使用ind数组，记录数组

ind[i] = j, if dp[j] is the max

class Solution(object):
    def largestDivisibleSubset(self, nums):
        if nums == []:
            return []
        nums.sort()
        # print nums

        dp = [1] * len(nums)
        ind = [-1] * len(nums)

        for i in xrange(len(nums)):
            t = 1
            for j in xrange(i):
                if nums[i] % nums[j] == 0 and dp[j] + 1 >= t:
                    t = dp[j]+1
                    ind[i] = j
            dp[i] = t

        maxx = max(dp)

        i = dp.index(maxx)#len(nums) - 1
        res = []
        while i >= 0:
            res += nums[ind[i]],
            i = ind[i]

        return res