试编写在带头结点的单链表L中删除一个最小值结点的高效算法(假设最小值结点是唯一的)
#include<stdio.h>
#include<stdlib.h>
typedef struct LNode {
int data;
struct LNode *next;
} LNode, *LinkList;
LinkList List_TailInsert(LinkList &L) {
int x;
L=(LinkList)malloc(sizeof(LNode));
L->data=999999;
LNode *s, *r=L;
printf("请输入数值\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;
}
void print(LinkList L) {
if(L->next==NULL)
printf("该链表为空");
LNode *p= L->next;
while(p!=NULL) {
printf("%d ",p->data);
p=p->next;
}
}
void delMin(LinkList &L) {
LNode *pre=L,*p=L->next;
LNode *minpre = pre, *minp = p;
while(p!=NULL) {
if(p->data<minp->data) {
minp = p;
minpre = pre;
}
pre = p;
p = p->next;
}
minpre->next = minp->next;
printf("\n删除结点的最小值为%d\n",minp->data);
free(minp);
}
int main() {
LinkList L=NULL;
int x;
List_TailInsert(L);
print(L);
delMin(L);
printf("\n");
print(L);
return 0;
}
运行结果