1.定义链表
typedef struct Node {
ElemType data; // 数据域
struct Node *next; // 指针域
} LNode, *LinkList; // struct Node* == LNode* == LinkList LNode强调节点,LinkList强调链表
2.创建空链表
void initiate(LinkList &L) //要对L进行操作更改就要用&
{
LNode *head = (LNode *)malloc(sizeof(LNode));
head->next = NULL;
L = head;
}
3.尾插法(正序)输入链表
void CreatList(LinkList &L, int n)
{
LinkList p, s;
p = L;
for (int i = 0; i<n; i++)
{
s = (LinkList)malloc(sizeof(LNode));
scanf("%d", &s->data);
p->next = s;
p = p->next;
}
p->next = NULL;
}
4.头插法(倒序)输入链表,可用于链表倒置
void CreatList(LinkList &L, int n) { LinkList p, s; p = L; for (int i = 0; i<n; i++) { s = (LinkList)malloc(sizeof(LNode)); scanf("%d", &s->data); s->next = p->next; p->next = s; } }
5.删除节点
bool ListDelete(LinkList &L, int n, ElemType &e) {
if (n <= 0 || n > ListLength(L)) {
return false;
}
int count = 0;
LNode *p = L;
while (p->next != NULL) {
count++;
p = p->next;
if (count == n - 1) {
e = p->next->data;
LNode *q = p->next;
p->next = q->next;
free(q);
return true;
}
}
}