typedef struct LNode
{
int data;
struct LNode* next;
}LNode, * LinkList;
Length
LNode *p = L;
int j = 0;
while(p->next)
p = p->next, j++;
CreateListF
s->next = L->next;
L->next = s;
CreateListR
r = L; // r 始终指向链表的尾结点
r->next = s;
r = s;
GetList [Find]
LNode *p = L;
int j = 0;
while(p->next && j < i)
LNode *p = L->next;
while(p && p->data != x)