ssl

#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
typedef int ElemType;
typedef struct{
ElemType data;
struct Node *next;
}Node,*LinkList;
void InitList(LinkList * L)
{
*L = (LinkList)malloc(sizeof(Node));
(*L)->next = NULL;
}
void CreateFromTail(LinkList L ,ElemType a[],int n)
{
int i;
Node r, s;
//L = (LinkList)malloc(sizeof(Node));
r = L;
for (i = 0; i < n; i++){
s = (LinkList)malloc(sizeof(Node));
s->data = a[i];
r->next = s;
r = s;
}
r->next = NULL;
}
int GetMax(LinkList L)/找到最大值/
{
Node * pmax;
Node * p;
if (L->next == NULL)
return NULL;
pmax = L->next;
p = L->next;/ 这有错误/
while §
{
if (p->data > pmax->data){
pmax = p;
}
p = p->next;
}
return pmax->data;
}
void DelMaxList(LinkList L)/删除最大值的结点/
{
LinkList p, pmax;
int max;
p = L->next;
max = p->data;
pmax = L;
while (p->next!=NULL)
{
if (p->data > max){
max = p->data;
pmax = p;
}
p = p->next;
}
p = pmax->next;
pmax->next = p->next;
free§;
}
void output(LinkList L)/遍历链表并输出/
{
LinkList p = L->next;
while §
{
printf("%d", p->data);
p = p->next;
}

printf("\n");

}
int MaxNode(LinkList L)
{
int j, k;
LinkList p, q;
if (L->next == NULL)
return 0;
q = L->next;
p = q->next;
k = 1;
j = 2;
while (p!=NULL)
{
if (p->data > q->data)
{
q = p;
k = j;
}
p = p->next;
j++;
}
return k;
}
int main()
{
int n;
LinkList L;
L = (LinkList)malloc(sizeof(Node));
L->next = NULL;
int a[5] = { 1, 2, 3, 4, 5 },pmax;
CreateFromTail(L,a,5);
output(L);
pmax = GetMax(L);
printf("%d\n", pmax);
n = MaxNode(L);
DelMaxList(L);

printf("最大值结点的位置是:%d\n",n);
output(L);
system("pause");
return 0;

}