368. Largest Divisible Subset (Medium) - TengnanYao/daily_leetcode GitHub Wiki

class Solution(object):
    def largestDivisibleSubset(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        nums.sort()
        result = [nums[0](/TengnanYao/daily_leetcode/wiki/nums[0)]
        for num in nums[1:]:
            temp_arr = [num]
            for arr in result:
                if num % arr[-1] == 0:
                    if len(arr) + 1 > len(temp_arr):
                        temp_arr = arr + [num]
            result.append(temp_arr)
        return max(result, key = len)