#include <stdio.h>
#include <stdlib.h>
#define N 8
typedef struct list
{int data;
struct list *next;
} SLIST;
void fun(SLIST *p)
{SLIST *t, *s;
t=p->next; s=p;
while(t->next != NULL)//目的是找到尾结点
{s=t;
/**********found**********/
t=t->next;//利用结点变量s和t,s指向当前节点,t不断指向下一个结点t
}
/**********found**********/
printf(" %d ",t->data);//出尾结点中的数据,已经利用循环找到了尾结点t,t的数据是t->data
s->next=NULL;
/**********found**********/
free(t);//输出尾结点数据之后删除尾结点,使用free,又因为尾结点是t
SLIST *creatlist(int *a)
{SLIST *h,*p,*q; int i;
h=p=(SLIST *)malloc(sizeof(SLIST));
for(i=0; i<N; i++)
{q=(SLIST *)malloc(sizeof(SLIST));
q->data=a[i]; p->next=q; p=q;
}
p->next=0;
return h;
}
void outlist(SLIST *h)
{SLIST *p;
p=h->next;
if (p==NULL) printf("\nThe list is NULL!\n");
else
{printf("\nHead");
do {printf("->%d",p->data); p=p->next;} while(p!=NULL);
printf("->End\n");
}
}
main()
{SLIST *head;
int a[N]={11,12,15,18,19,22,25,29};
head=creatlist(a);
printf("\nOutput from head:\n"); outlist(head);
printf("\nOutput from tail: \n");
while (head->next != NULL){
fun(head);
printf("\n\n");
printf("\nOutput from head again :\n"); outlist(head);
}
}