这两天在学习单链表,遇到了一些问题,在这里加以整理记录,以便复习
0.单链表的反序 (solved)
1.求单链表倒数第N个数(solved)
3.求中间结点 (solved)
3.给单链表建环 (solved)
4.检测单链表是否有环 (solved)
5.给单链表解环
6.检测两条链表是否相交 (solved)
7.不输入头节点,删除单链表的指定节点(只给定待删除节点指针)
0.单链表的反序 (solved)
status reverselist(linklist l)
{
linklist current=l->next,pnext,prev;
pnext=current->next;
current->next=NULL;
while(pnext)
{
prev=pnext->next;
pnext->next=current;
current=pnext;
pnext=prev;
}
l->next=current;
return OK;
}
status numbern2(linklist l,elemtype e,int n)
{
linklist fir=l->next,sec=l->next;
int i