转载自:http://blog.csdn.net/u011408355/article/details/47731021
这次的代码比较长,原因是比之前的Vector实现增加了许多的操作,而且毕竟指针操作嘛,处理起来稍微麻烦一点。
List实现中非常重要的一点,就是定义一个头指针和一个尾指针,这样可以避免对很多的特殊情况的处理,当链表为空时就是头指针指向尾指针,另外一个就是迭代器的实现,
list的迭代器的实现比vector要麻烦许多,因为内存不连续,所有采用了内部嵌套类的方式,重载了*(解引用),++EXP(前置++),++EXP(后置++),==和!=等操作符。
具体的大家可以看代码。
- <span style="font-size:14px;">//链表
- template<typename T>
- class List{
- private:
- //定义节点,并设置一个节点的初始化函数
- struct Node{
- T t;
- Node* pre;
- Node* next;
- Node(T tVal=T(),Node* preVal=NULL,Node* nextVal=NULL):t(tVal),pre(preVal),next(nextVal){}
- };
- public:
- /*const迭代器和非const迭代器的实现,因为const迭代器只是作为对数据的保护,很多操作都是相同的因此这里采用了继承*/
- class const_iterator{
- public:
- const_iterator():current(NULL){}
- const T& operator*() const{
- return retrieve();
- }
- //重载相关的操作符
- const_iterator& operator++(){
- current=current->next;
- return *this;
- }
- const_iterator operator++(int){
- const_iterator old=*this;
- ++(*this);
- return old;
- }
- bool operator==(const_iterator& rhs) const{
- return current==rhs.current;
- }
- bool operator!=(const_iterator& rhs)const{
- return current!=rhs.current;
- }
- protected:
- Node* current;
- T& retrieve() const{
- return current->t;
- }
- const_iterator(Node* p):current(p){}
- friend class List<T>;
- };
- class iterator:public const_iterator{
- public:
- iterator():current(NULL){}
- T& operator*(){
- return retrieve();
- }
- iterator& operator++(){
- current=current->next;
- return *this;
- }
- iterator operator++(int){
- iterator old=*this;
- current=current->next;
- return old;
- }
- const T& operator*()const{
- return const_iterator::operator*();
- }
- protected:
- iterator(Node* p):const_iterator(p){}
- friend class List<T>;
- };
- public:
- /* 构造函数和析构函数,init函数属于private成员,因此放在下面*/
- List(){
- init();
- }
- List(const List& rhs){
- init();
- operator=(rhs);
- }
- ~List(){
- clear();
- delete head;
- delete tail;
- }
- //重载操作符
- const List& operator=(const List& rhs){
- for(const_iterator cite=rhs.begin();cite!=rhs.end();cite++){
- push_back(*cite);
- }
- return *this;
- }
- T& operator[](int index){
- iterator ite=begin();
- for(int i=0;i<index;i++)
- ite++;
- return *ite;
- }
- //相关的操作函数
- T& front(){
- return *begin();
- }
- const T& front()const{
- return *begin();
- }
- T& back(){
- return *(--end());
- }
- const T& back()const{
- return *(--end());
- }
- void push_front(T t){
- Node* p=new Node(t);
- p->next=head->next;
- p->pre=head;
- p->next->pre=p;
- head->next=p;
- theSize++;
- }
- void push_back(T t){
- Node* p=new Node(t);
- p->pre=tail->pre;
- p->next=tail;
- p->pre->next=p;
- tail->pre=p;
- theSize++;
- }
- void pop_front(){
- Node* p=head->next;
- head->next=p->next;
- p->next->pre=head;
- delete p;
- theSize--;
- }
- void pop_back(){
- Node* p=tail->pre;
- tail->pre=p->pre;
- p->pre->next=tail;
- delete p;
- theSize--;
- }
- void insert(iterator itr,T t){
- Node* p=new Node(t);
- p->next=itr.current;
- p->pre=itr.current->pre;
- itr.current->pre->next=p;
- itr.current->pre=p;
- theSize++;
- }
- iterator erase(iterator itr){
- Node* p=itr.current->next;
- p->pre=itr.current->pre;
- p->pre->next=p;
- delete itr.current;
- return iterator(p);
- theSize--;
- }
- void erase(iterator start,iterator end){
- for(iterator ite=start;ite!=end){
- ite=erase(ite);
- theSize--;
- }
- }
- iterator begin(){
- return iterator(head->next);
- }
- const_iterator begin() const{
- return const_iterator(head->next);
- }
- iterator end(){
- return iterator(tail);
- }
- const_iterator end() const{
- return const_iterator(tail);
- }
- int size()const{
- return theSize;
- }
- bool empty()const{
- return theSize==0;
- }
- void clear(){
- while(theSize!=0){
- pop_back();
- }
- }
- private:
- int theSize;
- Node* head;
- Node* tail;
- void init(){
- theSize=0;
- head=new Node();
- tail=new Node();
- head->next=tail;
- tail->pre=head;
- }
- };</span>
有疑问或是发现错误,欢迎留言。