Largest Divisible Subset

 Largest Divisible Subset

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:

解析：

dp[i]表示包含num[i]的最长元素集，dp[i]=max(dp[i],dp[j]+1),对于dp[j]+1要求满足num[i]可以整除所有的num[j]中的元素。

代码：

class Solution {
public:
    vector<int> largestDivisibleSubset(vector<int>& nums) {
        if (nums.empty()) return {};
        vector<vector<int>> dp(nums.size());
        sort(nums.begin(),nums.end());
        int ans=0;
       // vector<int>ans;
        int anspos=0;
        for (int i=0; i<nums.size(); i++)
        {
            for (int j=0; j<i; j++)
            {
                int flag=0;
                for (int k=0; k<dp[j].size(); k++)
                {
                    if (nums[i]%(dp[j][k])!=0)
                    {
                        flag=1;
                        break;
                    }
                }
                
                if (flag==0&&dp[j].size()>dp[i].size())
                {
                    
                    dp[i]=dp[j];
                }
            }
            if ((dp[i].size()+1)>dp[anspos].size())
            anspos=i;
            dp[i].push_back(nums[i]);
        }
        return dp[anspos];
        
    }
};