#include<stack>

#include<iostream>#include<stack>using namespace std;int main(){  //創(chuàng)建棧 s  stack<int> s;  //將元素壓入棧  for(int i=0;i<10;i++){    s.push(i);  }//  if(!s.empty()){//    cout<<"棧s不是空的"<<endl;//  }  cout<<"棧s中元素的個(gè)數(shù)為："<<s.size()<<endl;  while(!s.empty()){    cout<<" "<<s.top();//獲取棧頂元素    s.pop();//彈出棧頂元素  }  cout<<endl;  if(s.empty()){    cout<<"棧s現(xiàn)在為空"<<endl;  }  return 0;}

#include<queue>

#include<iostream>#include<queue>using namespace std;int main(){  int ele,num,last;  queue<int> q;  for(int i=0;i<10;i++){    q.push(i);  }  if(!q.empty()){    cout<<"隊(duì)列不是空的"<<endl;  }  num=q.size();  cout<<"隊(duì)列q的長度為："<<num<<endl;  last=q.back();  cout<<"隊(duì)列q最后一個(gè)元素："<<last<<endl;  for(int j=0;j<q.size();j++){    ele=q.front();    cout<<ele<<" ";    q.pop();  }  cout<<endl;  if(q.empty()){    cout<<"隊(duì)列是空的"<<endl;  }  return 0;}

#include<vector>

#include<iostream>#include<vector>using namespace std;int main(){  //向向量v中添加元素  vector<int> v;  for(int i=0;i<10;i++){    v.push_back(i);  }  //從向量v中讀取數(shù)據(jù)  for(int i=0;i<v.size();i++){    cout<<" "<<v[i];  }  cout<<endl;  //使用迭代器遍歷數(shù)據(jù) 迭代器相當(dāng)于指針  cout<<"使用迭代器獲取數(shù)據(jù)"<<endl;  vector<int>::iterator iter;  for( iter = v.begin(); iter != v.end(); iter++ )  {   cout<<" "<< *iter;  }  cout<<endl;  //刪除數(shù)據(jù)  for(vector<int>::iterator it=v.begin();it!=v.end();){    v.erase(it);  }  if(v.empty()){    cout<<"向量v為空"<<endl;  }  return 0;}