#include<stdio.h> #include<stdlib.h> typedef int ElemType; typedef struct LNode{ ElemType data; struct LNode *next; }LNode,*LinkList; //尾插法 LinkList List_TailInsert(LinkList &L) { ElemType x; L=(LinkList)malloc(sizeof(LNode)); LNode *s,*r=L; printf("请输入单链表各个节点,以9999结束!\n"); scanf("%d",&x); while(x!=9999) { s=(LNode*)malloc(sizeof(LNode)); s->data=x; r->next=s; r=s; scanf("%d",&x); } r->next=NULL; return L; } int Length(LinkList L) { LNode *p=L; int count=0; while(p->next!=NULL) { p=p->next; count++; } return count; } //遍历带头结点单链表 输出最小节点并释放 void Min_Delete(LinkList &head){ while(head->next!=NULL) { LNode *minpre=head; LNode *p=head->next; while(p->next!=NULL) { if(p->next->data<minpre->next->data) minpre=p; p=p->next; } printf("->%d",minpre->next->data); LNode *u=minpre->next; minpre->next=u->next; free(u); } free(head); } int main(){ LinkList L; LinkList R; R=List_TailInsert(L); Min_Delete(R); }