聽 絳夈偮?鍦ㄨ繖閲屾垜灝嗚璇磛ector;
聽聽 vector<class T> vec錛?榪欐槸瀹氫箟涓涓┖鐨勫悜閲忥紝 鏂規(guī)硶鏈夛細(xì)size , push_back,pop_back; erase,empty,begin,end聽 榪斿洖榪唬鍣?絳夌瓑錛?榪樺彲浠ョ洿鎺ョ殑涓嬫爣鎿嶄綔 濡傦細(xì)vec[i]錛涜繕鏈夊氨榪唬鍣ㄤ簡聽 vector<class T>::iterartor it=vec.bengin();
聽 榪樻槸鐪嬬湅渚嬪瓙鍚э細(xì)
聽#include <iostream>
聽 #include <vector>
聽 using namespace std;
int main()
{
聽聽聽 vector<int> vec;
聽聽聽 int a;
聽聽聽 while(cin>>a)
聽聽聽 {
聽聽聽聽聽聽聽 vector.push_back(a);//vector鏄嚜鍔ㄥ垎閰嶇┖闂寸殑
聽聽聽 }
聽聽聽 for(int i=0;i<vec.size();i++)
聽聽聽 cout<<vec[i]<<endl;
聽聽聽 vec.pop_back();
聽聽聽 for(int i=0;i<vec.size();i++)
聽聽聽 cout<<vec[i]<<endl;
聽聽聽 return 1;
}
聽 褰撹緭鍏ユ槸錛? 2 3 4 5 鏃?br />杈撳嚭鏄細(xì)
1
2
3
4
5
1
2
3
4
濂戒簡鐜板湪鑳界畝鍗曠殑鐢ㄤ簡鍚э紒聽 鏈夐棶棰樺湪鍦ㄧ綉涓婄暀璦鍚э紒錛?/p>
priority_queue<class T, class comp=less< class Y>> 榛樿鐨勬槸浠ュぇ涓哄厛錛屻鏂規(guī)硶鏈夈push() , pop(), empty(), front().絳夌瓑
鐪嬬湅渚嬪瓙鍚э紒
#include聽<iostream>#include聽<queue>//鏈塸riority_queueusing聽namespace聽std;int聽main()
{
聽聽聽聽priority_queue<int>聽q;聽聽聽聽int聽a;聽聽聽聽while(cin>>a)
聽聽聽聽{聽聽聽聽聽聽聽聽q.push(a);
聽聽聽聽}聽聽聽聽while(!q.empty())聽聽聽聽{聽聽聽聽聽聽聽聽cout<<q.front()<<endl;聽聽聽聽聽聽聽聽q.pop();聽聽聽聽}聽聽聽聽return聽1;
}杈撳叆錛?聽 4 6 1 10 2 45 ctrl+z聽 ( ctrl+z鏄緭鍏ョ粨鏉熸爣蹇楋級
杈撳嚭錛?br />45
10
6
4
3
2
1
]]>
]]>