LeetCode368. 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]

实现：

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