//头文件
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
typedef int Elemtype;
typedef struct Node {
struct Node* next;
Elemtype date;
}Node,*pNode;
typedef struct List {
pNode first;
pNode last;
int num;
}List;
void initlist(List* list);
pNode BuyNode(List* list, Elemtype x);
void push_back(List* list, int x);
void show_list(List* list);
void push_front(List* list, int x);
void pop_back(List* list);
void pop_front(List* list);
pNode find(List* list, Elemtype x);
void sort(List* list);
void insert_pos(List* list, Elemtype V);
int lenght(List* list);
void delete_pos(List* list, Elemtype V);
void resert(List* list);
void clear(List* list);
void destroy(List* list);
//
//函数文件
#include"Lslist.h"
void initlist(List * list)
{
list->first=list->last = (pNode)malloc(sizeof(Node));
list->last->next = list->first;
list->num = 0;
}
pNode BuyNode(List* list, Elemtype x)
{
pNode s = (pNode)malloc(sizeof(Node));
if (s == NULL)
exit(-1);
s->date = x;
s->next = NULL;
return s;
}
void push_back(List* list, Elemtype x)
{
pNode s = BuyNode(list, x);
list->last->next = s;
s->next = list->first;
list->last = s;
list->num++;
return;
}
void show_list(List* list)
{
if (list->num == 0)
{
puts(“链表空,不能遍历”);
return;
}
pNode p = list->first->next;
while (p != list->first)
{
printf("%d->", p->date);
p = p->next;
}
printf(“Null\n”);<