set <vector<int> > myset;
vector<int> v1= { 34,634,758,46,64 };
vector<int >v2= {325, 7457, 586, 865};
myset.insert(v1);
myset.insert(v2);
set<vector<int> > ::iterator it;
it = myset.begin();
for (; it != myset.end(); it++)
{
vector<int> p = (*it);
vector<int> ::iterator temp;
for (temp = p.begin(); temp != p.end(); temp++)
{
cout << *temp << " ";
}
cout << endl;
}
我知道,当我们在集合或多集合中插入元素时,它会内部将元素排列为红色-黑树吗?
但是,容器如何确定任何这种复杂容器类型(例如vector
谢谢!..