Leetcode 368. Largest Divisible Subset (Medium) (cpp)

Leetcode 368. Largest Divisible Subset (Medium) (cpp)

Tag: Dynamic Programming, Math

Difficulty: Medium


/*

368. Largest Divisible Subset (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]

*/
class Solution {
public:
    vector<int> largestDivisibleSubset(vector<int>& nums) {
        int _size = nums.size();
        if (!_size) return nums;
        sort(nums.begin(), nums.end());
        vector<pair<int, int>> table(1, make_pair(1, -1));
        int globalMax = 1, index = 0;
        for (int i = 1; i < _size; i++) {
            int tempmax = 1, pre_index = -1;
            for (int j = i - 1; j >= 0; j--) {
                if (nums[i] % nums[j] == 0 && table[j].first >= tempmax) {
                    tempmax = table[j].first + 1;
                    pre_index = j;
                }
            }
            table.emplace_back(tempmax, pre_index);
            if (tempmax > globalMax) {
                globalMax = tempmax;
                index = i;
            }
        }
        vector<int> res;
        for (int i = 0; i < globalMax; i++, index = table[index].second)
            res.insert(res.begin(), nums[index]);
        return res;
    }
};


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Niko_Ke/article/details/52346672
文章标签: leetcode cpp
上一篇Leetcode 264. Ugly Number II (Medium) (cpp)
下一篇Leetcode 213. House Robber II (Medium) (cpp)
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭