C++ 模板循环链表练习

2017-11-24 09:58:24 216 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

数据结构之双向循环链表（C++实现）下午上机的时候大概地实现了链表的基本功能。写的时候也不是光是脑袋想，就在word里面画了个粗糙的图形，边看边写。刚刚开始的时候功能可以不要太多。把最基本的功能先实现，也就是数据定义,default constructor和destructor的功能。然后测试，再增加功能，这样后来写的时候出错的时候就会很明朗，至少不会是前面写的 function出错了。g++和vc下调试通过。main 阅读详情

初学C++ 刚看了模板的视频，自己把以前写的一个循环链表改成模板，添加的节点的那个函数死活编不过去，求大神帮看看



#include <iostream>

#include <cstring>//memset

using namespace std;



template<typename T>

struct Node

{

    T List_data;

    Node *List_pPre;

    Node *List_pNext;

};



template<typename T>

Node<T>* NewHead(const T data)

{

    Node<T>* listHead = new Node<T>;

    memset(listHead,0,sizeof(Node<T>));



    listHead->List_data = data;

    listHead->List_pNext = listHead;

    listHead->List_pPre = listHead;



    return listHead;

}



template<typename T>

void AddNod(Node<T>* listHead,const T data)

{

    Node<T>* ptemp = listHead;



    while(ptemp->List_pNext != listHead)

    {

        ptemp = ptemp->List_pNext;

    }



    Node<T>* m_Node = new Node<T>;

    memset(m_Node,0,sizeof(Node<T>));



    m_Node->List_data = data;

    m_Node->List_pNext = listHead;

    m_Node->List_pPre = ptemp;

    ptemp->List_pNext = m_Node;

    listHead->List_pPre = m_Node;



    cout << "add data = " << data << " success！" << endl;

}



template<typename T>

void ListDis(const Node<T>* listHead)

{

    Node<T>* ptemp = listHead->List_pNext;

    int i = 1;



    cout << "head" << " = " << listHead->List_data << endl;

    while(ptemp!= listHead)

    {

        cout << "Node" << i << " = " << ptemp->List_data << endl;

        ptemp = ptemp->List_pNext;

        i++;

    }

}



//加入a个节点后最多只能删a个节点,不能删除头节点

template<typename T>

void List_Delete_Node(Node<T>* listHead,T nNode)

{

    int m_count = 0;



    Node<T>* ptemp = listHead;

    while(ptemp->List_pNext != listHead)

    {

        m_count++;

        ptemp = ptemp->List_pNext;

    }

    if(0 >= nNode || m_count < nNode)

    {

        cout << "delete error!" << endl;

        return;

    }



    ptemp = listHead;

    m_count = nNode;

    while(m_count != 0)

    {

        m_count--;

        ptemp = ptemp->List_pNext;

    }

    ptemp->List_pNext->List_pPre = ptemp->List_pPre;

    ptemp->List_pPre->List_pNext = ptemp->List_pNext;

    delete ptemp;

    cout << "delete Node " << nNode << "success!" << endl;

}

template<typename T>

void List_Delete_All(Node<T>* listHead)

{

    Node<T>* ptemp = listHead;



    while(ptemp->List_pNext != listHead)

    {

        ptemp = ptemp->List_pNext;

        delete ptemp->List_pPre;

    }

    delete ptemp;

    cout << "delete all list success!" << endl;

}

int main()

{

    Node<int>* listHead;



    listHead = NewHead(0);

    AddNode(listHead,6); //E:\main.cpp:111: error: 'AddNode' was not declared in this scope

     AddNode(listHead,a);

    AddNode(listHead,9);

    AddNode(listHead,10);

    AddNode(listHead,11);

    AddNode(listHead,12);

    cout << "---------------------" << endl;



    ListDis(listHead);

    cout << "---------------------" << endl;



    List_Delete_Node(listHead,2);

    ListDis(listHead);

    cout << "---------------------" << endl;



    List_Delete_Node(listHead,2);

    ListDis(listHead);

    cout << "---------------------" << endl;

    List_Delete_All(listHead);

    return 0;

}