#include <iostream>
using namespace std;template <class T>
class mylist
{
public:struct Link{T data;Link* next;Link* prev;};//无参构造mylist():head(new Link),tail(new Link){//初始化head->data=NULL;tail->data=NULL;head->prev=NULL;head->next=tail;tail->prev=head;tail->next=NULL;}void insert(T data);//尾插法增void remove(T data);//删T &operator[](int index);//改void sort();//排序mylist& operator<<(T data);void show();//遍历
private:Link* head;Link* tail;};
//尾插法创建链表
template <typename T>
void mylist<T>::insert(T data)
{Link* l=tail->prev;Link* p=new Link;//定义指针指向创建的新节点p->data=data;//赋值p->next=tail;tail->prev=p;l->next=p;p->prev=l;
}//删除链表中的data数据
template <typename T>
void mylist<T>::remove(T data)
{Link* h=head->next;while(h->next!=NULL){if(h->data==data){Link* Q=h;//保存该节点Link* P=Q->prev;Link* N=Q->next;P->next=N;N->prev=P;delete h;break;}h=h->next;}
}
//修改节点内的值
template <typename T>
T &mylist<T>::operator[](int index)
{Link* h=head->next;int i;for(i=0;i<index;i++){h=h->next;}return h->data;
}template <typename T>
mylist<T> &mylist<T>::operator<<(T data)
{insert(data);return *this;
}template <typename T>
void mylist<T>::sort()
{Link* h=head->next;T data;while(h->next!=NULL){Link* N=h->next;while (N->next!=NULL){if(h->data>N->data){data=h->data;h->data=N->data;N->data=data;}N=N->next;}h=h->next;}}
//遍历
template <typename T>
void mylist<T>::show()
{Link* h=head->next;while(h->next!=NULL){cout<<h->data<<" ";h=h->next;}cout<<endl;
}
int main()
{mylist<int> p;p<<9<<2<<4<<8<<9<<0<<1;p.show();p.remove(2);p.show();p[0]=6;p.show();p.sort();p.show();return 0;
}
运行结果：
