【链表】链表基本操作

#include<iostream>


using namespace std;

typedef struct _NODE_
{
    int a;
    _NODE_* pNext;

}Node,*pNode;


class CList
{

private:
    pNode m_pHead;
    pNode m_pTail;
    int iNodeCount;

public:
    CList()
    {
        m_pHead = m_pTail = NULL;
        iNodeCount = 0;
    }
    ~CList()
    {

    }
    void InitList();
    pNode CreateNode(int a);
    bool LinkNode(pNode pNodeTemp);
    bool InsertNodeByIndex(pNode pNodeTemp,int iIndex);
    bool DeleteNode(int iIndex);
    void DestroyList();

    void TravelList()
    {
        if(m_pHead == NULL && iNodeCount == 0)
        {
            cout<<"List is Empty."<<endl;
            return ;
        }
        pNode pNodeTemp = m_pHead;

        for(int i = 0;i<iNodeCount;i++)
        {
            cout<<pNodeTemp->a<<ends;
            pNodeTemp = pNodeTemp->pNext;
        }
        cout<<endl;
    }

    
};


void CList::InitList()
{
    if(m_pHead != NULL)
    {
        DestroyList();
    }

    m_pHead = m_pTail = NULL;

    iNodeCount = 0;
}
pNode CList::CreateNode(int a)
{
    pNode pNodeTemp = new Node;

    if(pNodeTemp != NULL)
    {
        pNodeTemp->a = a;
        pNodeTemp->pNext = NULL;
        
        return pNodeTemp;
    }
    return false;
}
    
bool CList::LinkNode(pNode pNodeTemp)
{
    if(m_pHead == NULL)
    {
        m_pHead = m_pTail = pNodeTemp;
    }
    else
    {
        m_pTail->pNext = pNodeTemp;
        m_pTail = pNodeTemp;
    }

    iNodeCount++;

    return true;
}

bool CList::InsertNodeByIndex(pNode pNodeTemp,int iIndex)
{
    if(iIndex >=1 && iIndex <= iNodeCount)
    {
        pNode pNodeInsert = m_pHead;

        for(int i=1;i<iIndex-1;i++)
        {
            pNodeInsert = pNodeInsert->pNext;
        }
        
        pNodeTemp->pNext = pNodeInsert->pNext;
        pNodeInsert->pNext = pNodeTemp;

        iNodeCount++;
        return true;
    }

    return false;
}
bool CList::DeleteNode(int iIndex)
{
     pNode pNodeDel = m_pHead;
    for(int i=1;i<iIndex-1;i++)
    {
        pNodeDel = pNodeDel->pNext;
    }

    pNodeDel->pNext = pNodeDel->pNext->pNext;

    iNodeCount--;
    if(iNodeCount == 0)
    {
        m_pHead = m_pTail = NULL;
    }

    return true;
}

void CList::DestroyList()
{
    pNode pNodeDel = m_pHead;

    while(pNodeDel != NULL)
    {
        m_pHead = m_pHead->pNext;

        delete pNodeDel;

        pNodeDel = m_pHead;

        iNodeCount--;
    }

    m_pHead = m_pTail = NULL;
    
    iNodeCount = 0;
}






int main()
{

    CList CListObj;

    pNode pNodeTemp = {0};

    int i = 0;
    int a = 0;
    int iIndex = 0;
    cout<<"Test."<<endl;
    for(i=0;i<5;i++)
    {
        cout<<"Please Input Data:"<<endl;
        cin>>a;
        pNode pNodeTemp = CListObj.CreateNode(a);
        CListObj.LinkNode(pNodeTemp);
    }
    CListObj.TravelList();

    cout<<"Input a Index to Delete."<<endl;
    cin>>iIndex;

    CListObj.DeleteNode(iIndex);
    
    CListObj.TravelList();

    cout<<"Input Data and Index to Inesert."<<endl;
    cout<<"Data:"<<endl;
    cin>>a;
    cout<<"Index:"<<endl;
    cin>>iIndex;
    pNodeTemp = CListObj.CreateNode(a);

    CListObj.InsertNodeByIndex(pNodeTemp,iIndex);

    
    CListObj.TravelList();


    cout<<endl;

    cout<<"DestroyList."<<endl;

    CListObj.DestroyList();

    cout<<endl;
    CListObj.TravelList();
    return 0;
}