C++链表基本操作

LinearList.cpp

/*
    458043535@qq.com
    xxdfly
*/
#include "LinearList.h"

//构造函数
LinearList::LinearList()
{
    head = (Node*)malloc(sizeof(Node));
    head->next=0;
}

//返回链表长度
int LinearList::ListLength()
{
    Node *p;
    int length=0;
    p=head->next;
    while(p)
    {
        p=p->next;
        length++;
    }
    return length;
}

//判断链表是否为空，若为空返回true，否则返回false
bool LinearList::EmptyList()
{
    if(head->next==0)
        return true;
    else
        return false;
}

//打印链表
LinearList::ShowList()
{
    Node *p=head->next;
    while(p)
    {
        cout << p->data << "	";
        p=p->next;
    }
    cout << endl;
}

//在链表i位置上插入元素e
LinearList::InserList(int i,int e)
{
    int length=ListLength();

    if(i<1||i>length+1)
    {
        cout << "insert location parameter is illegal" << endl;
    }
    else
    {
        int count=1;
        Node *p,*q;
        Node *elem=new Node;
        
        p=q=head;
        elem->data=e;
        elem->next=0;
        
        while(count<=length+1)
        {
            if(count==i)
            {
                elem->next=p->next;
                q->next=elem;
                break;
            }

            p=q=q->next;
            count++;
        }
    }
}

//删除链表i位置上的元素
LinearList::DeletList(int i)
{
    int length=ListLength();

    if(i<1||i>length+1)
    {
        cout << "delete location parameter is illegal" << endl;
    }
    else
    {
        int count=1;
        Node *p,*q;
        p=q=head;
        while(count<=length+1)
        {
            if(count==i)
            {
                q->next=p->next->next;
                break;
            }
            q=p=p->next;
            count++;
        }
    }
}

//获取链表i位置上的数据
int LinearList::GetData(int i)
{
    int length=ListLength();
    int result;
    if(i<1||i>length)
    {
        cout << "delete location parameter is illegal" << endl;
    }
    else
    {
        int count=0;
        Node *p=head;
        while(count<=length)
        {
            if(count==i)
            {
                result=p->data;
                break;
            }
            p=p->next;
            count++;
        }
    }
    return result;
}

//将链表置空
LinearList::ClearList()
{
    head->next=0;
}

//获取包含e元素的节点(只寻找第一个)
Node* LinearList::Locate(int e)
{
    Node *elem=0;
    Node *p=head->next;
    while(p)
    {
        if(e==p->data)
        {
            elem=p;
            break;    
        }
        p=p->next;
    }
    return elem;
}

//销毁链表
LinearList::~LinearList()
{
    if(head)
        delete []head;
    cout << "the nodelist is destroyed" << endl;
}

LinearList.h

#include <iostream>
using namespace std;

struct Node
{
    int data;
    Node *next;
};

class LinearList
{
    public:
        Node *head;
    public:
        LinearList();
        ~LinearList();
        InserList(int i,int e);
        DeletList(int i);
        DestroyList();
        ClearList();
        ShowList();

        int ListLength();
        int GetData(int i);

        Node* Locate(int e);
        bool EmptyList();
};

main.cpp

#include "LinearList.h"

int main(int argc, char* argv[])
{
    Node* node=new Node;
    LinearList *list=new LinearList;

    cout << list->head << endl;
    cout << list << endl;

    cout << list->EmptyList() << endl;
    cout << list->ListLength() << endl;
    
    int data1=23;

    list->InserList(1,data1);
    list->ShowList();
    list->InserList(2,520);
    list->InserList(3,1314);
    list->ShowList();

    Node *e = list->Locate(1314);
    cout << e->data << "	" << "&e=" << e << "	e->next=" << e->next << endl;
    int a=list->GetData(2);
    cout << "a=" << a << endl;

    list->DeletList(2);
    list->ShowList();

    list->ClearList();
    list->ShowList();
    delete list;
    list->head;
    cout << list->head << endl;
    cout << list << endl;
    return 0;
}