题目
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]
题意分析
给定一个没有重复数字的数组,找出最大的子集,使这个子集每两个元素之间满足如下关系:
s[i] % s[j] = 0 或者 s[j] % s[i] = 0
思路分析
这是一个动态规划题目。为了方便进行动态规划,我们首先需要对数组进行排序,接着给排序好的元素设一个parent数组,还有rank数组,parent数组表示它能整除的比他小的”最大”元素所在排序好的位置,由于题目要求找出最大的子集,因此还需要设置一个rank数组,对于一个处在位置j的元素,如果处在位置i(i小于j)的元素它能整除,并且rank[i] >= rank[j]时,才能设置j的parent为i,两层循环即可,算法复杂度为O(n^2)
AC代码
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
vector<int> largestDivisibleSubset(vector<int>& nums) {
if (nums.size() == 0) return vector<int>();
sort(nums.begin(), nums.end());
int vecsize = nums.size();
int* p = new int[nums.size()];
int* q = new int[nums.size()];
for (int i = 0; i < nums.size(); ++i) {
p[i] = i;
q[i] = 1;
}
for (int i = 0; i < nums.size() - 1; ++i) {
for (int j = i + 1; j < nums.size(); ++j) {
if (nums[j] % nums[i] == 0 && q[i] >= q[j]) {
p[j] = i;
q[j] = q[i] + 1;
}
}
}
vector<vector<int>> resultvec;
for (int i = nums.size() - 1; i >= 0; --i) {
int cur = i;
vector<int> temp;
temp.push_back(nums[cur]);
while (p[cur] != cur) {
cur = p[cur];
temp.push_back(nums[cur]);
}
resultvec.push_back(temp);
}
int res = -1, sel = 0;
for (int i = 0; i < resultvec.size(); ++i) {
int cursize = resultvec[i].size();
if (cursize > res) {
res = cursize;
sel = i;
}
}
reverse(resultvec[sel].begin(), resultvec[sel].end());
return resultvec[sel];
}
};
int main() {
int a[] = {2,3,4,8,9};
vector<int> vec(a, a+5);
Solution s;
auto ss = s.largestDivisibleSubset(vec);
std::cout << "Hello, World!" << std::endl;
return 0;
}