- 通过C语言实现的链表操作
void ReverseDisplayLinkList(linklist *head)
:Reverse print the linklist data but not include head nodeint ChangeDataLinkList(linklist *head, data_t olddata, data_t newdata)
linklist * FindLocalNode(linklist *phead, int local)
:Find the node localvoid ReverseLinklistOne(linklist **head)
:reverse the linklist, iteration(迭代法)void ReverseLinklistTwo(linklist **head)
:reverse the linklist,recurrence(递归)bool JudgeLoopLinklist(linklist *head)
:判断链表是否存在环linklist* LinklistSwap(linklist *phead, linklist *pNodeFirst, linklist *pNodeSecond)
:swap the nodem,parameter is any address of the two node