Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - CPP - 368. Largest Divisible Subset

---

參考資訊：
https://algo.monster/liteproblems/368
https://www.cnblogs.com/grandyang/p/5625209.html

題目：


解答：

class Solution {
public:
    vector<int> largestDivisibleSubset(vector<int>& nums) {
        sort(nums.begin(), nums.end());

        int n = nums.size();
        int max_index = 0;

        vector<int> dp(n, 1);
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < i; ++j) {
                if (nums[i] % nums[j] == 0) {
                    dp[i] = max(dp[i], dp[j] + 1);
                }
            }

            if (dp[i] > dp[max_index]) {
                max_index = i;
            }
        }

        int size = dp[max_index];
        vector<int> ans;
        int cur_index = max_index;

        for (int i = max_index; size > 0; --i) {
            if (nums[cur_index] % nums[i] == 0 && dp[i] == size) {
                ans.push_back(nums[i]);
                cur_index = i;size -= 1;
            }
        }

        return ans;
    }
};