leetcode - 368. Largest Divisible Subset

最新推荐文章于 2024-07-22 16:27:42 发布

KpLn_HJL

最新推荐文章于 2024-07-22 16:27:42 发布

阅读量946

点赞数 22

分类专栏： OJ题目记录文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/sinat_41679123/article/details/136089034

版权

OJ题目记录专栏收录该内容

515 篇文章 1 订阅

订阅专栏

文章描述了一种算法，使用动态规划解决一个给定一组不重复正整数的问题，目标是找到最长的子集，使得任意两个元素之间存在整除关系。通过维护以每个数结尾的最长子集长度，找到了求解该问题的有效方法。时间复杂度为O(n^2)，空间复杂度为O(n)。

摘要由CSDN通过智能技术生成

Description

Given a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies:

answer[i] % answer[j] == 0, or
answer[j] % answer[i] == 0

If there are multiple solutions, return any of them.

Example 1:

Input: nums = [1,2,3]
Output: [1,2]
Explanation: [1,3] is also accepted.

Example 2:

Input: nums = [1,2,4,8]
Output: [1,2,4,8]

Constraints:

1 <= nums.length <= 1000
1 <= nums[i] <= 2 * 10^9
All the integers in nums are unique.

Solution

Solved after help…

Use dp[i] to keep track of the length of longest subset that ends with nums[i], then the transformation equation is:
$\max(dp[j]), \forall \;nums[i] \% nums[j] == 0$

Because we need to return the longest subset, so when updating the dp, we add another dimension to remember j that we finally choose.

Time complexity: $o(n^2)$
Space complexity: $o (n)$

Code

class Solution:
    def largestDivisibleSubset(self, nums: List[int]) -> List[int]:
        dp = [[1, i] for i in range(len(nums))]
        nums.sort()
        for i in range(1, len(nums)):
            for j in range(i):
                if nums[i] % nums[j] == 0:
                    if dp[j][0] + 1 > dp[i][0]:
                        dp[i][0] = dp[j][0] + 1
                        dp[i][1] = j
        max_len = 1
        res = [nums[dp[0][1]]]
        for i in range(len(dp)):
            if dp[i][0] > max_len:
                res = []
                max_len = dp[i][0]
                index = dp[i][1]
                start_i = i
                while index != start_i:
                    res.append(nums[start_i])
                    start_i = index
                    index = dp[start_i][1]
                res.append(nums[start_i])
        return res