// 梦令布孑.cpp : 定义控制台应用程序的入口点。
//这个链表类包含了链表的添加和删除,至于创建在构造函数里面已经创建出了一个头结点。用法在main函数 里面实现了!
//
#include "stdafx.h"
#include<iostream>
using namespace std;
struct NODE
{
int num;
char *name;
NODE *next;
};
class MyList
{
private:
NODE *head,*pRead,*pAdd;
int listSize;
public :
MyList();
~MyList();
void addNode(NODE* newNode);
void addNode(NODE* newNode,int n);
void delNode(NODE *delNode);
void printListSize();
void printList();
};
MyList::MyList()
{
listSize = 0;
pAdd = new NODE;
pAdd->num= 0;
pAdd->name = "表头";
pAdd->next = NULL;
head = pRead = pAdd;
}
MyList::~MyList()
{
}
void MyList::printListSize()
{
cout<<"此链表当前长度为: "<<this->listSize<<endl;
}
void MyList::printList()
{
while (pRead!=NULL)
{
cout<<pRead->num<<endl;
cout<<pRead->name<<endl;
pRead = pRead->next;
}
}
void MyList::addNode(NODE *newNode)
{
if (!newNode)
{
newNode = new NODE;
}
else
{
pAdd->next = newNode;
pAdd =pAdd->next;
listSize++;
}
}
void MyList::delNode(NODE *delNode)
{
NODE *pDel = pRead;
while (pDel!=NULL)
{
if (delNode->next!=NULL)
{
if (pDel->next!=delNode)
{
pDel = pDel->next;
}else
{
pDel->next = delNode->next;
listSize--;
}
}else
{
if (pDel->next!=delNode)
{
pDel = pDel->next;
}else
{
pDel->next = NULL;
listSize--;
}
}
}
}
int _tmain(int argc, _TCHAR* argv[])
{
NODE node ={1,"蒙蒙",NULL};
NODE node1 = {2,"红红",NULL};
NODE node2 = {3,"天天",NULL};
NODE node3 = {4,"画画",NULL};
MyList *list = new MyList;
list->addNode(&node);
list->addNode(&node1);
list->addNode(&node2);
list->addNode(&node3);
list->delNode(&node);
list->delNode(&node3);
list->printListSize();
list->printList();
return 0;
}