#ifndef _LIST_H_
#define _LIST_H_
#include <stdio.h>
typedef struct MyStruct
{
int date;
MyStruct *next;
}Node;
class List{
public:
List()
{
head = NULL;
m_size = 0;
}
void Add(Node *node); //添加
void remove(Node *node);//删除
void remove(int positon);//删除
int set(int position,Node *node); //修改
Node get(int positions);//获取
void revise();//倒置
void show();
private :
Node *head;
int m_size;
};
#endif
#include "List.h"
void List::Add(Node *node)
{
if (head == NULL)
{
head =node;
}
else
{
Node *temp = head;
while (temp->next!=NULL)
{
temp = temp->next;
}
temp->next = node;
}
m_size++;
}
void List::remove(int positon)
{
}
void List::remove(Node *node)
{
if (NULL != head)
{
Node *temp = head;
Node*pre = temp;//前一个节点
while (temp!=NULL)
{
if (node->date == temp->date)
{
m_size--;
if (head == node ) //当删除的是头的时候
{
head = head->next;
delete temp;
break;
}
else if(NULL == temp->next) //删除的末尾
{
pre->next = NULL;
delete temp;
break;
}
else //删除的中间
{
pre->next = temp->next;
delete temp;
break;
}
}
pre = temp;
temp=temp->next;
}
}
}
Node List::get(int positions)
{
int i = 0 ;
Node *temp = NULL;
if (positions>m_size)
{
return *temp;
}
temp = head;
while (i<positions&&temp->next!=NULL)
{
temp = temp->next;
i++;
}
return *temp;
}
int List::set(int position,Node *node)
{
int i = 0 ;
Node *temp = head;
Node *pre = temp;
if (position > m_size)
{
return 0;
}
while (i < position&&temp->next != NULL)
{
pre = temp;
temp = temp->next;
i++;
}
if (position == 0)
{
//修改的是头结点
node->next = head->next;
head = node;
}
else
{//修改的其他节点
pre->next =node;
node->next = temp->next;
}
delete temp;
return i;
}
void List::revise()
{
if (head==NULL||head->next==NULL) //为空或者只有一个节点
{
return;
}
else
{
Node *pre = head;
Node * next = head->next;
Node *now = head->next;
while (now != NULL)
{
next = now->next; //先保存now的下一个节点
now->next = pre;
pre = now;
now = next;
}
head->next = NULL;//修改最末一位
head = pre;//该表表头
}
}
void List::show()
{
Node *temp = head;
while (temp!=NULL)
{
printf("%d\t",temp->date);
temp = temp->next;
}
}
然后是调用代码
#include "List.h"
int main()
{
List *list = new List();
Node *node1 = new Node();
node1->date = 1;
node1->next = NULL;
list->Add(node1);
/*Node *node2 = new Node;
node2->date = 2;
node2->next = NULL;
list->Add(node2);
*/
Node *node3 = new Node;
node3->date = 3;
node3->next=NULL;
list->Add(node3);
// list->remove(node3);
Node *set = new Node();
set->date = 8;
set->next =NULL;
// list->set(0,set);
list->revise();
list->show();
}