#include <iostream>
#include<vector>
#include<deque>
using namespace std;
void test();
void test01();
void printDequeInt(deque<int> &d);
int main()
{
test();
cout << "Hello World!" << endl;
return 0;
}
//vector假象
//deque原理: 中控器+内存
void test()
{
//vector<int> v1;
deque<int> v1;
//v1.reserve(1000);//预留空间
int* p = NULL;
int count = 0;
int i = 0;
for(i=0;i<1000;i++)
{
v1.push_back(i);
if(p!=&v1[0])
{
count++;
p = &v1[0];
}
}
cout<<"开辟次数"<<count<<endl;
}
void test01()
{
deque<int> d1(5,100);
printDequeInt(d1);
}
void printDequeInt(deque<int> &d)
{
deque<int>::iterator it = d.begin();
for(;it!=d.end();it++)
{
cout<<*it<<" ";
}
cout<<endl;
}
vector指数申请空间
最新推荐文章于 2023-07-26 16:47:46 发布