Leetcode-368. Largest Divisible Subset_largest k-divisible subsequence-CSDN博客

本文链接：https://blog.csdn.net/caoyan_12727/article/details/52904132

题目：

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]

链接：https://leetcode.com/problems/largest-divisible-subset/

这个题看到subset而不是subsequence当时想的是求一个最大子串的问题，而不是子序列问题，但是看了leetcode的讨论之后发现大家采用的是subsequence版本。下面是我的

subsequece版本源码：

class Solution {
public:
	vector<int> largestDivisibleSubset(vector<int>& nums) {
		vector<int>result;
		vector<int>tmp = nums;
		sort(tmp.begin(), tmp.end());//排序
		int size = tmp.size();
		if (size == 0)return result;
		vector<int>dp(size, 0);
		int tmp_dp=0;
		int max_dp=0;
		int total_max = 0;
		int index = -1;
		for (int i = 0; i < size; i++){
			dp[i] = 1;
			max_dp = -INT_MAX;
			for (int j = i - 1; j >= 0; j--){
				if (tmp[i] % tmp[j] == 0){
					tmp_dp = dp[j] + 1;
					if (tmp_dp>max_dp)max_dp = tmp_dp;
				}
			}
			if (max_dp > 1)dp[i] = max_dp;
			if (dp[i] >= total_max){
				total_max = dp[i];
				index = i;
			}
		}
		//逆向处理
		int start = total_max;//长度标号
		int last_num = tmp[index];
		result.push_back(last_num);
		for (int i = size - 1; i >= 0; i--){
			if (dp[i] == start - 1 && last_num%tmp[i] == 0){
				result.push_back(tmp[i]);
				start--;
			}
		}
		std::reverse(result.begin(),result.end());
		return result;
	}
};

结果：