leetcode:数学: Largest Divisible Subset(368)

原创 2016年08月31日 14:21:32

https://leetcode.com/problems/largest-divisible-subset/


http://blog.csdn.net/qq508618087/article/details/51767785


class Solution {  
public:  
    vector<int> largestDivisibleSubset(vector<int>& nums) {  
        if(nums.size() ==0) return {};   
        sort(nums.begin(), nums.end(), greater<int>());  
        int len = nums.size(), curMax=1, k=0;  
        vector<int> par(len), dp(len, 1), result;  
        for(int i =0; i < len; i++) par[i] = i;  
        for(int i =1; i < len; i++)  
        {  
            for(int j =0; j < i; j++)  
            {  
                if(nums[j]%nums[i]!=0) continue;  
                if(dp[i] < dp[j]+1) par[i] = j, dp[i]=dp[j]+1;  
                if(dp[i] > curMax) curMax = dp[i], k = i;  
            }  
        }  
        while(par[k] != k)  
        {  
            result.push_back(nums[k]);  
            k = par[k];  
        }  
        result.push_back(nums[k]);  
        return result;  
    }  
};  
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

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

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

leetcode_middle_79_368. Largest Divisible Subset

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

[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
  • 282

LeetCode No.368. Largest Divisible Subset

LeetCode No.368. Largest Divisible Subset

368. Largest Divisible Subset -Medium

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

[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
  • 67
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode:数学: Largest Divisible Subset(368)
举报原因:
原因补充:

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