1.基本思路:
如果A 是满足题意要求的一个集合(不一定是最优集合),即A的任意元素属于数组nums, 且任意两个属于A的元素Si, Sj 满足条件:Si%Sj等于0 或 Sj%Si等于0; 假设Sk是当前集合A中的最大值,若存在一个元素elem( elem也属于nums ),且elem%Sk 等于 0,当将elem加入A形成新的子集A‘, 则A’也同样满足题意要求,不断“填充”集合A,则可以找出最优集合!
class Solution {
public:
vector<int> largestDivisibleSubset(vector<int>& nums) {
if (nums.empty() == true)
return ret;
record.resize(nums.size());
sort(nums.begin(),nums.end());
for(int i = 0;i < nums.size(); ++i){
record[i]=1;
int CheckPoint = 0; // 第二个循环停止条件
for(int j = i-1; j >= 0; --j){
if (nums[i] % nums[j] == 0){
if (CheckPoint != 0 && nums[j] % CheckPoint == 0)
break;
else{
if (CheckPoint == 0)
CheckPoint = nums[j];
record[i] = record[i] > record[j]+1 ? record[i] : record[j]+1;
}
}
}
}
vector<int>::iterator biggestIter = max_element(record.begin(), record.end());
int index = distance(record.begin(), biggestIter);
ret.push_back(nums[index]);
int last = index;
for (int i = index - 1; i >= 0 ;--i){
if (record[last] == record[i] + 1 && nums[last] % nums[i] == 0){
ret.push_back(nums[i]);
last = i ;
}
}
return ret;
}
private:
vector<int> record;
vector<int> ret;
};