/************************************************************************/
/* 单链表的增删改查 */
/************************************************************************/
#include <iostream>
#include <string.h>
#include <stdlib.h>
using namespace std;
class list_Node
{
public:
void set();
void set(int data);
list_Node* get();
void addNode(int data);
void printNode();
void deleteNode(int data);
void modify(int oldData,int newData);
void find(int data);
private:
int data;
list_Node * next;
};
//定义一个链表头
list_Node *pHead = NULL;
//定义一个链表尾
list_Node *tail ;
int NodeNum = 0;
//************************************
// Method: set方法
// FullName: list_Node::set
// Access: public
// Returns: void
// Qualifier:
//************************************
void list_Node::set()
{
this->next = NULL;
}
void list_Node::set( int data )
{
this->data = data;
this->next = NULL;
}
//************************************
// Method: get方法
// FullName: list_Node::get
// Access: public
// Returns: list_Node*
// Qualifier:
//************************************
list_Node* list_Node::get()
{
return this;
}
//************************************
// Method: addNode 尾插法
// FullName: list_Node::addNode
// Access: public
// Returns: void
// Qualifier:
// Parameter: int data
//************************************
void list_Node::addNode( int data )
{
list_Node* p = new list_Node;
p->set(data);
if (pHead == NULL)
{
pHead = p;
tail = pHead;
}
else{
tail->next = p;
tail = p;
}
}
//************************************
// Method: printNode 打印所有节点
// FullName: list_Node::printNode
// Access: public
// Returns: void
// Qualifier:
//************************************
void list_Node::printNode()
{
NodeNum = 0;
list_Node *p = pHead;
while(p)
{
cout << p->data << " " ;
NodeNum++;
p = p->next;
}
cout << "总共" << NodeNum << "个节点" << endl;
}
//************************************
// Method: deleteNode(按照数据进行删除节点)
// FullName: list_Node::deleteNode
// Access: public
// Returns: void
// Qualifier:
// Parameter: int data
//************************************
void list_Node::deleteNode( int data )
{
list_Node * p = NULL;
p = pHead;
list_Node *q;
bool flg = true;
while(p->next)
{
if (p->data == data && p == pHead)
{
q = p;
p = p->next;
delete q;
pHead = p;
flg = false;
}
else if (p->next->data == data)
{
q = p->next;
p->next = q->next;
delete q;
flg = false;
}
else{
p = p->next;
}
}
if (flg)
{
printf("链表中没有此数据\n");
}
}
//************************************
// Method: modify(链表的修改)
// FullName: list_Node::modify
// Access: public
// Returns: void
// Qualifier:
//************************************
void list_Node::modify(int oldData,int newData)
{
list_Node *p = pHead;
bool flg = false;
while(p)
{
if (p->data == oldData)
{
p->data = newData;
flg = true;
}
p = p->next;
}
if (!flg)
{
printf("链表中没有匹配的数据\n");
}
}
//************************************
// Method: find(查找链表中的数据)
// FullName: list_Node::find
// Access: public
// Returns: void
// Qualifier:
// Parameter: int data
//************************************
void list_Node::find( int data )
{
list_Node *p = pHead;
bool flg = false;
while(p)
{
if (p->data == data)
{
printf("存在%d数据\n",data);
flg = true;
}
p = p->next;
}
if (!flg)
{
cout << "链表中无此数据"<< data << endl;
}
}
int main()
{
pHead->addNode(100); pHead->addNode(1);pHead->addNode(4);
pHead->addNode(4);pHead->addNode(100);pHead->addNode(6);
pHead->printNode();
pHead->deleteNode(100);pHead->deleteNode(4);pHead->deleteNode(6);
pHead->printNode();
pHead->modify(4,999);
pHead->printNode();
}
/* 单链表的增删改查 */
/************************************************************************/
#include <iostream>
#include <string.h>
#include <stdlib.h>
using namespace std;
class list_Node
{
public:
void set();
void set(int data);
list_Node* get();
void addNode(int data);
void printNode();
void deleteNode(int data);
void modify(int oldData,int newData);
void find(int data);
private:
int data;
list_Node * next;
};
//定义一个链表头
list_Node *pHead = NULL;
//定义一个链表尾
list_Node *tail ;
int NodeNum = 0;
//************************************
// Method: set方法
// FullName: list_Node::set
// Access: public
// Returns: void
// Qualifier:
//************************************
void list_Node::set()
{
this->next = NULL;
}
void list_Node::set( int data )
{
this->data = data;
this->next = NULL;
}
//************************************
// Method: get方法
// FullName: list_Node::get
// Access: public
// Returns: list_Node*
// Qualifier:
//************************************
list_Node* list_Node::get()
{
return this;
}
//************************************
// Method: addNode 尾插法
// FullName: list_Node::addNode
// Access: public
// Returns: void
// Qualifier:
// Parameter: int data
//************************************
void list_Node::addNode( int data )
{
list_Node* p = new list_Node;
p->set(data);
if (pHead == NULL)
{
pHead = p;
tail = pHead;
}
else{
tail->next = p;
tail = p;
}
}
//************************************
// Method: printNode 打印所有节点
// FullName: list_Node::printNode
// Access: public
// Returns: void
// Qualifier:
//************************************
void list_Node::printNode()
{
NodeNum = 0;
list_Node *p = pHead;
while(p)
{
cout << p->data << " " ;
NodeNum++;
p = p->next;
}
cout << "总共" << NodeNum << "个节点" << endl;
}
//************************************
// Method: deleteNode(按照数据进行删除节点)
// FullName: list_Node::deleteNode
// Access: public
// Returns: void
// Qualifier:
// Parameter: int data
//************************************
void list_Node::deleteNode( int data )
{
list_Node * p = NULL;
p = pHead;
list_Node *q;
bool flg = true;
while(p->next)
{
if (p->data == data && p == pHead)
{
q = p;
p = p->next;
delete q;
pHead = p;
flg = false;
}
else if (p->next->data == data)
{
q = p->next;
p->next = q->next;
delete q;
flg = false;
}
else{
p = p->next;
}
}
if (flg)
{
printf("链表中没有此数据\n");
}
}
//************************************
// Method: modify(链表的修改)
// FullName: list_Node::modify
// Access: public
// Returns: void
// Qualifier:
//************************************
void list_Node::modify(int oldData,int newData)
{
list_Node *p = pHead;
bool flg = false;
while(p)
{
if (p->data == oldData)
{
p->data = newData;
flg = true;
}
p = p->next;
}
if (!flg)
{
printf("链表中没有匹配的数据\n");
}
}
//************************************
// Method: find(查找链表中的数据)
// FullName: list_Node::find
// Access: public
// Returns: void
// Qualifier:
// Parameter: int data
//************************************
void list_Node::find( int data )
{
list_Node *p = pHead;
bool flg = false;
while(p)
{
if (p->data == data)
{
printf("存在%d数据\n",data);
flg = true;
}
p = p->next;
}
if (!flg)
{
cout << "链表中无此数据"<< data << endl;
}
}
int main()
{
pHead->addNode(100); pHead->addNode(1);pHead->addNode(4);
pHead->addNode(4);pHead->addNode(100);pHead->addNode(6);
pHead->printNode();
pHead->deleteNode(100);pHead->deleteNode(4);pHead->deleteNode(6);
pHead->printNode();
pHead->modify(4,999);
pHead->printNode();
}