https://leetcode.com/problems/largest-divisible-subset/

largest-divisible-subset.py

class Solution(object):
    def largestDivisibleSubset(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        if not nums: return []
        from_big_nums = sorted(nums)
        dp = []
        for i,n in enumerate(from_big_nums):
            # print dp
            last_divisiable = [s for s in dp if n % s[-1] == 0]
            if last_divisiable:
                dp.append(max(last_divisiable, key=len) + [n])
            else:
                dp.append([n])
        # print dp
        return max(dp, key=len)