我编写了以下函数,作为该算法/方法的实现,以生成给定字符串的幂集(所有子集的集合):
vector<string> getAllSubsets(string a, vector<string> allSubsets)
{
if(a.length() == 1)
{
// Base case,
allSubsets.push_back("");
allSubsets.push_back(a);
}
else {
vector<string> temp = getAllSubsets(a.substr(0,a.length()-1),allSubsets);
vector<string> with_n = temp;
vector<string> without_n = temp;
for(int i = 0;i < temp.size()-1;i++)
{
allSubsets.push_back(with_n[i] + a[a.length()-1]);
allSubsets.push_back(without_n[i]);
}
}
return allSubsets;
}
但是,似乎有人出了问题:从递归调用到递归调用的大小temp
和allSubsets
保持不变,而当它们由于调用而应该增加时push_back()
。有什么理由会发生这种情况吗?