带头结点的情况下单链表的操作
#include <stdio.h>
#include <stdlib.h>
typedef struct LNode {
ElemType data;
struct LNode* next;
}LNode,*LinkList;
typedef int ElemType;
bool InitList(LinkList& L) {
L = (LNode*)malloc(sizeof(LNode));
if (L == NULL)
return false;
L->next = NULL;
return true;
}
LinkList List_TailInsert(LinkList& L) {
int x;
L = (LNode*)malloc(sizeof(LNode));
LNode* s,*r=L;
scanf_s("%d\n", &x);
while (x!=9999)
{
s = (LNode*)malloc(sizeof(LNode));
s->data = x;
r->next = s;
r = s;
scanf_s("%d\n", &x);
}
r->next = NULL;
return L;
}
LinkList List_HeadInsert(LinkList& L) {
LNode* s;
int x;
L = (LinkList)malloc(sizeof(LNode));
L->next = NULL;
scanf_s("%d\n", &x);
while (x!=9999)
{
s = (LNode*)malloc(sizeof(LNode));
s->data = x;
s->next = L->next;
L->next = s;
scanf_s("%d\n", &x);
}
return L;
}
bool ListInsert(LinkList& L, int i, ElemType e) {
if (i < 1)
return false;
LNode* p;
int j = 0;
p = L;
while (p!=NULL&&j<i-1)
{
p = p->next;
j++;
}
if (p == NULL)
return false;
LNode* s = (LNode*)malloc(sizeof(LNode));
s->data = e;
s->next = p->next;
p->next = s;
return true;
}
bool InsertNextNode(LNode *p, ElemType e) {
if (p == NULL)
return false;
LNode* s = (LNode*)malloc(sizeof(LNode));
if (s == NULL)
return false;
s->data = e;
s->next = p->next;
p->next = s;
return true;
}
bool InsertPriorNode(LNode* p, ElemType e) {
if (p == NULL)
return false;
LNode* s = (LNode*)malloc(sizeof(LNode));
if (s == NULL)
return false;
s->next = p->next;
p->next = s;
s->data = p->data;
p->data = e;
return true;
}
bool ListDelete(LinkList& L, int i, ElemType e) {
if (i < 1)
return false;
LNode* p;
int j = 0;
p = L;
while (p != NULL && j < i - 1)
{
p = p->next;
j++;
}
if (p == NULL)
return false;
if (p->next == NULL)
return false;
LNode* q = p->next;
e = q->data;
p->next = q->next;
free(q);
return true;
}
bool DeleteNode(LNode* p) {
if (p == NULL)
return false;
LNode* q = p->next;
p->data = p->next->data;
p->next = q->next;
free(q);
return true;
}
LNode* GetElem(LinkList L, int i) {
if (i < 0)
return NULL;
LNode* p;
int j = 0;
p = L;
while (p!=NULL&&j<i)
{
p = p->next;
j++;
}
return p;
}
LNode* LocateElem(LinkList L, ElemType e) {
LNode* p = L->next;
while (p != NULL && p->data != e)
p = p->next;
return p;
}
int Length(LinkList L) {
int len = 0;
LNode* p=L;
while (p != NULL && p->data != e) {
p = p->next;
len++;
}
return len;
}
int main() {
return 0;
}