#include<stdio.h>
#include<stdlib.h>
/*
* 编写在带头结点的单链表L中删除一个最小值结点的高效算法(假设最小值结点唯一)
*/
typedef struct LNode {
int data;
struct LNode* next;
}LNode,*LinkList;
LinkList CreateList(LinkList &L) //尾插法创建链表
{
int x;
LNode* r, * s;
L = (LinkList)malloc(sizeof(LNode));
r= L;
scanf("%d", &x);
while (x != 99)
{
s = (LNode*)malloc(sizeof(LNode));
s->data = x;
r->next= s;
r = s;
scanf("%d", &x);
}
r->next = NULL;
return L;
}
LinkList DeleteMin(LinkList& L)
{
LNode* p = L;
LNode* t = L->next;
LNode* s;
while (t->next)
{
if (t->next->data < p->next->data)
{
p = t;
}
t = t->next;
}
s = p->next;
p->next = s->next;
free(s);
return L;
}
void PrintList(LinkList L)
{
L = L->next; //让头结点指向第一个元素
while (L != NULL)
{
printf("%4d", L->data);
L = L->next;
}
printf("\n");
}
int main()
{
LinkList L;
CreateList(L);
DeleteMin(L);
PrintList(L);
return 0;
}