slistdemo.cpp

《数据结构课程设计案例精编》 附赠光盘源码

/* 单链表应用示例 */

#include <iterator>
#include <iostream>
#include <ext/slist>    //包含其类信息的头文件
#include <algorithm>

using namespace std;
using namespace __gnu_cxx;   //名字空间名为__gnu_cxx

int main()
{
    slist<int> mySlist;

    mySlist.push_front(9);
    mySlist.push_front(2);
    mySlist.push_front(1);
    mySlist.push_front(3);
	mySlist.insert(mySlist.begin(),4);
	
	slist <int>::iterator iter1=mySlist.begin(); 
	cout<<"链表的长度为："<<mySlist.size()<<endl;
	cout<<"对应的元素为："<<endl;   //输出4 3 1 2 9
    for(; iter1 != mySlist.end(); ++iter1)
        cout << *iter1 
             << ' ';
    cout<<endl;  

    iter1 = find(mySlist.begin(), mySlist.end(), 1);
    if (iter1!=0)
        mySlist.insert_after(iter1, 67);
	cout<<"插入元素后链表的长度为："<<mySlist.size()<<endl;
	cout<<"对应的元素为："<<endl;   //输出4 3 1 67 2 9
	copy(mySlist.begin(), mySlist.end(),    
       ostream_iterator<int>(cout, " "));
	cout<<endl;

    iter1 = find(mySlist.begin(), mySlist.end(), 3);
    if (iter1!=0)
		mySlist.erase_after(iter1);
	cout<<"删除元素后链表的长度为："<<mySlist.size()<<endl;
	cout<<"对应的元素为："<<endl;   //输出4 3 67 2 9
    copy(mySlist.begin(), mySlist.end(),   
       ostream_iterator<int>(cout, " "));
	cout<<endl;

	system("pause");
    return 0;
}