数据结构——单链表

借了一本超级坑爹的数据结构的书，Adam Drozdek 陈曙晖翻译的，大家绝对不要去借，太坑了，一大堆的错误。开始学C++和数据结构。坚持！

#include <iostream>
#include "Linked.h"

using namespace std;

//单链表

//析构函数
IntSLList::~IntSLList()
{
    for(IntNode* p ;!isempty();)
    {
        p = head->next;
        delete head;
        head = p;
    }
}

//addtohead
void IntSLList::addToHead(int el)
{
    head = new IntNode(el,head);
    if(tail == 0)
    {
        tail = head;
    }
}

//addtotail
void  IntSLList::addToTail(int el)
{
    if(tail != 0)
    {
        tail->next = new IntNode(el);
        tail = tail->next;
    }
    else
    {
        head = tail = new IntNode(el);
    }
}

//deleteFromHead
int IntSLList::deleteFromHead()
{
    int el = head->info;
    IntNode* tmp = head;
    if(tail == head)
    {
        head = tail = 0;
    }
    else
    {
        head = head->next;
    }
    delete tmp;
    return el;
}

//deleteFromTail
int IntSLList::deleteFromTail()
{
    int el = tail->info;
    if(head == tail)
    {
        delete head;
        head = tail = 0;
    }
    else
    {
        IntNode* tmp;
        for(tmp = head;tmp->next != tail;tmp=tmp->next); //为了把tmp指针移到tail前一个
        delete tail;
        tail = tmp;
        tail->next = 0;
    }
    return el;
}

//deleteNode，关键在于el是内部点
void IntSLList::deleteNode(int el)
{
    if(head != 0)
    {
        if(head == tail && el == head->info)  //just one node
        {
            delete head;
            head = tail = 0;
        }
        else //more nodes
        {
            if(el == head->info)
            {
                IntNode* tmp = head;
                head = head->next;
                delete tmp;
            }
            else
            {
                IntNode* pred,* tmp;
                for(pred=head,tmp=head->next;tmp!=0 && (tmp->info == el);pred=pred->next,tmp=tmp->next);//find address
                if(tmp != 0)
                {
                    pred->next = tmp->next;
                    if(tmp == tail)
                    {
                        tail = pred;
                    }
                    delete tmp;
                }
            }
        }
    }
}

int main()
{
    IntSLList isl;
    isl.addToHead(12);
    isl.deleteFromTail();
}

Linked.h

#ifndef LINKED_H_INCLUDED
#define LINKED_H_INCLUDED

class IntNode
{
public:
    int info;
    IntNode* next;
    IntNode(int el,IntNode* ptr=0)
    {
        info = el;
        next = ptr;
    }
};

class IntSLList
{
public:
    IntSLList()
    {
        head = tail = 0;
    }
    ~IntSLList();
    int isempty()
    {
        return head == 0;
    }
    void addToHead(int);
    void addToTail(int);
    int deleteFromHead();
    int deleteFromTail();
    void deleteNode(int);
    bool IsInList(int) const;

private:
    IntNode* head,*tail;
};


#endif // LINKED_H_INCLUDED