设计一个算法,删除一个单链表L中元素值最大的结点(假设最大值结点是唯一的)。
#include <stdio.h>
#include<malloc.h>
typedef struct Node
{
int data;
struct Node *next;
}LinkList;
void InitList(LinkList*& L)
{
L = (LinkList*)malloc(sizeof(LinkList));
L->next = NULL;
}
void CreateListTail(LinkList *&L, int n)
{
LinkList *p, *r;
int i,t;
L = (LinkList*)malloc(sizeof(Node));
r = L;
for (i = 0; i < n; i++)
{
p = (LinkList*)malloc(sizeof(Node));
scanf_s("%d", &t);
p->data = t;
r->next = p;
r = r->next;
}
r->next = NULL;
}
void ListDelete(LinkList *&L)
{
LinkList *p,*q,*maxp,*maxq;
p = L->next;
q = L;
maxp = p;
maxq = q;
while (p!=NULL)
{
if (maxp->data < p->data)
{
maxp = p;
maxq = q;
}
q = p;
p = p->next;
}
maxq->next = maxp->next;
free(maxp);
}
void Print(LinkList *L)
{
LinkList* p = L->next;
while (p != NULL)
{
printf("%d ", p->data);
p = p->next;
}
printf("\n");
}
int main()
{
int n;
LinkList *L;
scanf_s("%d", &n);
InitList(L);
CreateListTail(L, n);
ListDelete(L);
Print(L);
return 0;
}