链表的C++实现(int型) 源代码

//Node.h

#ifndef NODE_H

#define NODE_H


class Node
{
public:
int data;
Node *next;
void printNode();
};

#endif

//Node.cpp

#include"Node.h"
#include<iostream>
using namespace std;


void Node::printNode()
{
cout<<data<<endl;
}

//List.h

#ifndef LIST_H
#define LIST_H


#include"Node.h"


class List
{
public:
List();
~List();
void ClearList();
bool ListEmpty();
int ListLength();
bool GetElem(int i,Node *pNode);
int LocateElem(Node *pNode);
bool PriorElem(Node *pCurrentNode,Node *pPreNode);
bool NextElem(Node *pCurrentNode,Node *pNextNode);
void ListTraverse();
bool ListInsert(int i,Node *pNode);
bool ListDelete(int i,Node *pNode);
bool ListInsertHead(Node *pNode);
bool ListInsertTail(Node *pNode);
private:
Node * m_pList;
int m_iLength;

};
#endif

//List.cpp

#include"List.h"
#include<iostream>
using namespace std;


List::List()
{
m_pList = new Node;
m_pList->data=0;
m_pList->next = 0;
m_iLength=0;
} 


List::~List()
{
ClearList();
delete m_pList;
m_pList = 0;
}


void List::ClearList()
{
Node *currentNode = m_pList->next;
while(currentNode == NULL)
{
Node *temp = currentNode->next;
delete currentNode;
currentNode = temp;
}
m_pList->next = 0;
}


bool List::ListEmpty()
{
if(m_iLength ==0)
{
return true;
}
else
{
return false;
}
}


int List::ListLength()
{
return m_iLength;
}


bool List::ListInsertHead(Node *pNode)
{
Node *temp = m_pList ->next;
Node *newNode  = new Node;
if(newNode == 0)
{
return false;
}
newNode -> data =pNode ->data;
m_pList ->next = newNode;
newNode ->next = temp;
m_iLength++;
return true;
}


bool List::ListInsertTail(Node *pNode)
{
Node *currentNode =m_pList;
while(currentNode->next!= 0)
{
currentNode = currentNode->next;
}
Node *newNode  = new Node;
if(newNode == 0)
{
return false;
}
newNode->data=pNode->data;
newNode->next=0;
currentNode ->next = newNode;
m_iLength++;
return true;
}


bool List::ListInsert(int i,Node *pNode)
{
if(i< 0 ||i>m_iLength)
{
return false;
}
Node *currentNode = m_pList;
for(int k = 0;k<i; k++)
{
currentNode = currentNode->next;
}
Node *newNode  = new Node;
if(newNode == 0)
{
return false;
}
newNode->data = pNode->data;
newNode->next=currentNode->next;
currentNode->next = newNode;
m_iLength++;
return true;
}


bool List::ListDelete(int i,Node *pNode)
{
if(i<0||i>=m_iLength)
{
return false;
}
Node *currentNode = m_pList;
Node *currentNodeBefore = 0;
for(int k = 0;k<=i;k++)
{
currentNodeBefore=currentNode;
currentNode=currentNode->next;
}
currentNodeBefore->next=currentNode->next;
pNode->data=currentNode->data;
delete currentNode;
delete currentNode;
m_iLength--;
return true;
}


bool List::GetElem(int i,Node *pNode)
{
if(i<0||i>=m_iLength)
{
return false;
}
Node *currentNode = m_pList;
Node *currentNodeBefore =0 ;
for(int k = 0;k<= i;k++)
{
currentNodeBefore=currentNode;
currentNode=currentNode->next;
}
pNode->data = currentNode->data;
return true;
}


int List::LocateElem(Node *pNode)
{
Node *currentNode = m_pList;
int count = 0;
while(currentNode->next!= 0)
{
currentNode = currentNode->next;
if(currentNode->data==pNode->data)
{
return count;
}
count++;
}
return -1;
}


bool List::PriorElem(Node *pCurrentNode,Node *pPreNode)
{
Node *currentNode = m_pList;
Node *tempNode = 0;
while(currentNode->next != 0)
{
tempNode = currentNode;
currentNode = currentNode->next;
if(currentNode->data == pCurrentNode->data)
{
if(tempNode==m_pList)
{
return false;
}
pPreNode->data = tempNode->data;
return true;
}
}
return false;
}


bool List::NextElem(Node *pCurrentNode,Node *pNextNode)
{

Node *currentNode = m_pList;

while(currentNode->next !=0)
{
currentNode = currentNode->next;
if(currentNode->data == pCurrentNode->data)
{
if(currentNode->next == 0)
{
return false;
}
pNextNode->data = currentNode->next->data;
return true;
}
}
return false;
}


void List::ListTraverse()
{
Node *currentNode = m_pList;
while(currentNode->next!=0)
{
currentNode = currentNode->next;
currentNode->printNode();
}
}

//demo.cpp

#include"Node.h"
#include"List.h"
#include<iostream>
using namespace std;


int main(void)
{
Node node1;
node1.data = 3;
Node node2;
node2.data = 4;
Node node3;
node3.data = 5;
Node node4;
node4.data = 6;
Node node5;
node5.data = 7;
Node temp;


Node node6;
node6.data = 8;

List *pList = new List();



// pList->ListInsertHead(&node1);
// pList->ListInsertHead(&node2);
// pList->ListInsertHead(&node3);
// pList->ListInsertHead(&node4);
// pList->ListInsertHead(&node5);
// pList->ListTraverse();


pList->ListInsertTail(&node1);
pList->ListInsertTail(&node2);
pList->ListInsertTail(&node3);
pList->ListInsertTail(&node4);
pList->ListInsertTail(&node5);

pList->ListInsert(1,&node6);

pList->ListDelete(1,&temp);

pList->GetElem(1,&temp);

pList->NextElem(&node2,&temp);


pList->ListTraverse();


cout<<"temp = "<<temp.data<<endl;

delete pList;
pList = 0;


system("pause");
return 0;
}