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

原创 2016年08月28日 17:11:30

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;
    }
};


版权声明:本文为博主原创文章,未经博主允许不得转载。

Leetcode 368. Largest Divisible Subset[medium]

题目: Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj...

368. Largest Divisible Subset -Medium

Question Given a set of distinct positive integers, find the largest subset such that every pair (...

LeetCode #368: Largest Divisible Subset

Problem Statement(Source) Given a set of distinct positive integers, find the largest subset such th...

Leetcode 368. Largest Divisible Subset

368. Largest Divisible Subset Total Accepted: 939 Total Submissions: 2935 Difficulty: Medium ...

leetcode_middle_79_368. Largest Divisible Subset

题意: 给一列数,找出其中最长的一个子序列。使序列中所有的数字两两可整除。 分析: 随便举个例子分析dp[ i ] 1  2  3  9  16  32 比如截止9这时候最长的是139,但是到最...
  • pusude
  • pusude
  • 2017年03月08日 15:16
  • 92

LeetCode No.368. Largest Divisible Subset

LeetCode No.368. Largest Divisible Subset

[leetcode] 368. Largest Divisible Subset

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of...

Leetcode 368. Largest Divisible Subset思路及详解

题目链接:368. Largest Divisible SubsetGiven a set of distinct positive integers, find the largest subset...
  • xindoo
  • xindoo
  • 2016年11月05日 17:58
  • 291

[LeetCode]:动态规划+回溯 Largest Divisible Subset 最大可整除的子集合

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) o...

Leetcode Largest Divisible Subset

题意:给定一个集合,找到该集合的最大子集,使得该子集内的所有元素都可以相互整除。 思路:将元素排序,从最大的开始DFS。适当剪枝,当当前的集合已经大于剩下的集合就停止搜索。 class Solut...
  • markpen
  • markpen
  • 2016年12月24日 14:50
  • 72
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Leetcode 368. Largest Divisible Subset (Medium) (cpp)
举报原因:
原因补充:

(最多只允许输入30个字)