#include <stdio.h>
#include <iostream>
using namespace std;
#include <stdlib.h>
typedef struct LNode
{
int data;
struct LNode *next;
} LNode, *LNodeList;
void InitList_Head(LNodeList &L) // 头插法
{
L = new LNode;
L->data = 0;
L->next = NULL;
for (int i = 0; i < 10; i++)
{
LNodeList s = new LNode;
s->data = i;
s->next = L->next;
L->next = s;
}
}
void InitList_Tear(LNodeList &L) // 尾插法
{
L = new LNode;
// L->data = 0;
LNodeList r = L;
L->next = NULL;
for (int i = 1; i <= 5; i++)
{
LNodeList s = new LNode;
printf("请输入%d个关键字:", i);
scanf("%d", &s->data);
// cin >> s->data;
// s->data = i;
s->next = nullptr;
r->next = s;
r = s;
}
}
void printfList(LNodeList L) // 打印单链表
{
LNodeList q = L->next;
int i = 0;
while (q != NULL)
{
printf("%d ", q->data);
i++;
q = q->next;
}
printf("单链表长度:%d\n", i);
}
void Devide(LNodeList &La, LNodeList &Lb, LNodeList &Lc)
{
LNodeList pa = La->next;
Lb = new LNode();
Lc = new LNode();
Lb->next = nullptr;
Lc->next = nullptr;
LNodeList Rb = Lb;
LNodeList Rc = Lc;
while (pa)
{
if (pa->data < 0)
{
Rb->next = pa;
Rb = pa;
}
else
{
Rc->next = pa;
Rc = pa;
}
pa = pa->next;
}
Rb->next = nullptr;
Rc->next = nullptr;
}
int main()
{
LNodeList A;
LNodeList B;
LNodeList C;
// InitList_Head(myList1); // 头插法
InitList_Tear(A); // 尾插法
printfList(A);
Devide(A, B, C);
printf("结点B中的值:");
printfList(B);
printf("结点C中的值:");
printfList(C);
}
运行结果如下