STL list for linklist

/* * ===================================================================================== * * Filename: list.cpp * * Description: test for STL list * * Version: 1.0 Created: 2010/1/17 16:30:27 Revision: none Compiler: * g++ * * Author: bird Company: nbut * * ===================================================================================== */ #include<iostream> #include <list> #include <algorithm> using namespace std; int main ( int argc, char *argv[] ){ list<int > ls; //length; cout <<"first length is:"<< ls.size() << endl; //insert; list<int >::iterator iter =ls.begin(); ls.insert(iter,0); cout <<"after insert 0 ,length is:"<< ls.size() << endl; int n=10; while(n--){ ls.push_back(n); } cout <<"after insert 10 int,length is:"<< ls.size() << endl; //find iter=find(ls.begin(),ls.end(),8); cout <<"the item find is:"<< *(iter) << endl; //get; cout <<"the item get is:"<< *(ls.begin()) << endl; //delete; ls.erase(ls.begin()); cout <<"after delete, the length is:"<< ls.size() << endl; return EXIT_SUCCESS; } /* ---------- end of function main ---------- */

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值