- C语言实现链表基本数据结构的基本操作
- 参考《数据机构与算法分析》
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct Node;
typedef struct Node *PtrToNode;
typedef PtrToNode List;
typedef PtrToNode Position;
typedef int ElementType;
struct Node
{
ElementType Element;
Position Next;
};
Position Init()
{
Position head;
head = (Position)malloc(sizeof(struct Node));
if (head == NULL)
{
printf("init failed!");
return NULL;
}
head->Next = NULL;
return head;
}
Position Init()
{
Position head;
head = (Position)malloc(sizeof(struct Node));
if (head == NULL)
{
printf("init failed!");
return NULL;
}
head->Next = NULL;
return head;
}
void Insert(ElementType X, List L, Position P)
{
Position TmpCell;
TmpCell = (Position)malloc(sizeof(struct Node));
if (TmpCell == NULL)
{
printf("malloc space failed!");
return;
}
TmpCell->Element = X;
TmpCell->Next = P->Next;
P->Next = TmpCell;
}
void PrintList(List L)
{
Position TmpNode = L->Next;
while (TmpNode != NULL)
{
printf("%d\n", TmpNode->Element);
TmpNode = TmpNode->Next;
}
}
Position Find(ElementType X, List L)
{
Position P = L->Next;
while (P != NULL && P->Element != X)
{
P = P->Next;
}
return P;
}
Position FindPrevious(ElementType X, List L)
{
Position P = L;
while (P->Next != NULL && P->Next->Element != X)
{
P = P->Next;
}
return P;
}
void Delete(ElementType X, List L)
{
Position P, TmpCell;
P = FindPrevious(X, L);
TmpCell = P->Next;
P->Next = TmpCell->Next;
free(TmpCell);
}
int main(int argc, char const *argv[])
{
List L = Init();
Position TmpNode = L;
for (int i = 0; i < 5; i++)
{
Insert(i, L, TmpNode);
TmpNode = TmpNode->Next;
}
PrintList(L);
// Position Tmp = FindPrevious(3, L);
// printf("%d\n", Tmp->Element);
Delete(3, L);
PrintList(L);
return 0;
}