LeetCode--Largest Divisible Subset

Given a set of distinct positive integers, find the largest subset such that every pair (S_i, S_j) of elements in this subset satisfies: S_i % S_j = 0 or S_j % S_i = 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]

本题的思路就是给定一个数组，输出最长的满足数组中任意两个元素一个可以被另一个整除的这个给定数组的子数组。

这道题可以用动态规划来解决。我们先将给定的数组从小到大排序，然后状态转移方程为：

div[i]=max(div[j]+1, div[i])（前提是i可以整除j，div[i]代表从小到大排列的原数组中从0开始计数的第i个元素可以整除的元素的个数），如果div[i]的值被更新，那么就更新pre[i]=j以及maxSize(记录最大子数组的长度)。这些都是之后用于输出子数组的。

找到最大的div[i]之后根据pre数组就可以输出对应的最大子数组。

代码如下：

class Solution {
public:
	vector<int> largestDivisibleSubset(vector<int>& nums) {
		vector<int> res;
		if (nums.size() == 0) return res;
		if (nums.size() == 1){
			res.push_back(nums[0]);
			return res;
		}
		sort(nums.begin(), nums.end());
	 
		vector<int> div(nums.size(),1);
		vector<int> pre(nums.size(),-1);

		int maxSize = 1;
		int maxi = 0;

		for (int i = 1; i < nums.size(); i++){
			for (int j = 0; j < i; j++){
				if (nums[i] % nums[j] == 0&&div[j] + 1>div[i]){
					div[i] =  div[j] + 1;
					pre[i] = j;
				}
				if (div[i]>maxSize){
					maxSize = div[i];
					maxi = i;
				}
			}
		}

		int i = maxi;
		while (maxSize--){
			res.push_back(nums[i]);
			i = pre[i];
		}

		return res;
	}
};