/*试编写在带头结点的单链表L中删除一个最小值结点的高效算法(假设最小值结点是唯一的)*/
#include<stdio.h>
#include<stdlib.h>
typedef int ElemType;
typedef struct LNode
{
ElemType data;
struct LNode *next;
}LNode,*LinkList;
LinkList TailCreateList(LinkList &L)
{
L = (LinkList)malloc(sizeof(LNode));
ElemType x;
LNode *r = L;
scanf("%d",&x);
while(x!=9999)
{
LNode *s = (LNode*)malloc(sizeof(LNode));
s->data = x;
r->next = s;
r = s;
scanf("%d",&x);
}
r->next = NULL;
return L;
}
LinkList delMinValList(LinkList &L)
{
LNode *pre = L;
LNode *p = pre->next;
LNode *min = p,*minpre = pre;
while(p!=NULL)
{
if(p->data<min->data)
{
minpre = pre;
min = p;
}else{
pre = p;
p = p->next;
}
}
minpre->next = min->next;
free(min);
return L;
}
bool printList(LinkList L)
{
LNode *p = L->next;
while(p!=NULL)
{
printf("%d ",p->data);
p = p->next;
}
printf("\n");
return true;
}
void main()
{
LinkList L;
TailCreateList(L);
printList(L);
delMinValList(L);
printList(L);
}
链表-删除最小值结点
最新推荐文章于 2022-04-20 20:24:28 发布