一段有误代码,对于紫皮书上的栈这一小节完全没看懂,先向后学一下吧,以后知识多了再来看这个
#include<iostream>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;
typedef set<int> Set;
map<Set, int > IDcache; //如何把集合映射成ID;
vector<Set> Setcache;
int ID(Set x)
{
if(IDcache.count(x)) return IDcache[x];
Setcache.push_back(x);
return IDcache[x] = Setcache.size() - 1;
}
#define ALL(x) x.begin(), x.end()
#define INS(x) inserter(x, x.begin())
int main()
{
stack<int> s;
int m;
while(m--)
{
int n;
cin >> n;
for(int i = 0; i < n; i++)
{
string op;
cin >> op;
if(op[0] == 'P') s.push(ID(Set()));
else if(op[0] == 'D') s.push(s.top());
else
{
Set x1 = Setcache[s.top()]; s.pop();
Set x2 = Setcache[s.top()]; s.pop();
Set x;
if(op[0] == 'U') set_union (ALL(x1), ALL(x2), INS(x));
if(op[0] == 'I') set_intersection (ALL(x1), ALL(x2), INS(x));
if(op[0] == 'A') {x = x2; x.insert(ID(x1));}
s.push(ID(x));
}
cout << Setcache[s.top()].size() << endl;
}
cout << "***" << endl;
}
return 0;
}