直接上代码
#include<bits\stdc++.h>
using namespace std;
int main(void) {
double dur;
//vector<vector<vector<int > > > a;
vector<int>b; vector<int>::iterator it;
vector<int, list<int> >a;
vector<int>a1;
clock_t start, end;
start = clock();
for(int i=0;i<100;++i)
a.push_back(1);
//a.resize(6, 2);
for (auto &i : a)
cout << i << ' ';
cout << endl;
end = clock();
dur = (double)(end - start);
cout << "first use time: " << (dur / CLOCKS_PER_SEC)<<endl;
cout << endl;
start = clock();
for (int i = 0; i<100; ++i)
a1.push_back(1);
//a1.resize(6, 2);
for (auto &i : a1)
cout << i << ' ';
cout << endl;
end = clock();
dur = (double)(end - start);
cout << "second use time: " << (dur / CLOCKS_PER_SEC) << endl;
return 0;
}
运行结果如下:
本文通过代码示例,对比了C++中不同类型的向量在执行相同操作时的性能差异,包括使用list作为内含容器的向量与普通向量的对比。

561

被折叠的 条评论
为什么被折叠?



