[leetcode]368. Largest Divisible Subset

题目链接：https://leetcode.com/problems/largest-divisible-subset/#/description

Given a set of distinct positive integers, find the largest subset such that every pair (S_i, S_j) of elements in this subset satisfies: S_i % S_j = 0 or S_j % S_i = 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]

方法一：（dp）

class Solution {public:    vector<int> largestDivisibleSubset(vector<int>& nums) {        sort(nums.begin(),nums.end());        vector<vector<int>> result(nums.size());        vector<int> ret;        for(int i=0;i<nums.size();i++)        {            for(int j=0;j<i;j++)            {                if(nums[i]%nums[j]==0 && result[j].size()>result[i].size())                {                    result[i]=result[j];                }            }            result[i].push_back(nums[i]);            if(ret.size()<result[i].size()) ret=result[i];        }        return ret;    }};