LeetCode 368: Largest Divisible Subset

368. Largest Divisible Subset

Difficulty: Medium
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]

思路

本题是要找到数组的最大可整除的子集。
首先对无序的数组进行排序，依次遍历数组元素；
用排在当前元素前的每个数去整除该元素；
若可整除，则找到一个当前元素为最大倍数的可整除子集，该子集的元素个数为除数的最大子集个数加一，且该子集中排在当前元素前一位的数为除数，所有可整除子集中元素最多的子集为该元素的最大可整除子集；
所有元素的最大可整除子集中元素最多的即为最终结果。

代码

[C++]

class Solution {
public:
    vector<int> largestDivisibleSubset(vector<int>& nums) {
        vector<int> res;
        if (nums.size() == 0)
            return res;
        sort(nums.begin(), nums.end());
        vector<int> len(nums.size(), 1);
        vector<int> son(nums.size(), 0);
        int largest = 0;
        int largesti = 0;
        for (int i = 0; i < nums.size(); ++i) {
            for (int j = 0; j < i; ++j) {
                if (nums[i] % nums[j] == 0 && len[i] < len[j] + 1) {
                    len[i] = len[j] + 1;
                    son[i] = j;
                }
            }
            if (largest < len[i]) {
                largesti = i;
                largest = len[i];
            }
        }
        for (int i = 0; i < largest; ++i) {
            res.insert(res.begin(), nums[largesti]);
            largesti = son[largesti];
        }
        return res;
    }
};