#include "stdio.h"
#include "stdlib.h"
//链表结构
struct mdt
{
int data; //存放数据
struct mdt * next; //存放指针
}MDT;
//创建链表
struct mdt *creat()
{
int c;
struct mdt *h,*s,*r; //h 头部指针 s 当前指针 r 尾部指针
h=(struct mdt *)malloc (sizeof(struct mdt)); //产生头结点
r=h; //尾部指向头部
scanf("%d",&c); //读入数据
while (c!=-1)
{
s=(struct mdt *)malloc (sizeof(struct mdt)); //生成新的结点
s->data=c; //数据存入data
r->next=s; //新结点连到表尾
r=s; //指向当前表尾
scanf("%d",&c);
}
r->next='';
return h; //返回创建的表头
}
//打印链表
void print(struct mdt *head)
{
struct mdt *p;
p=head->next;
if (p==' ') printf("链表是空的n");
else
{
printf("链表数据:n");
do
{
printf("->%d",p->data);
p=p->next;
}while (p!=' ');
printf("n");
}
}
//查找最大值并返回值
int maxvalue(struct mdt *head)
{
int max;
struct mdt *p;
p=head->next;
if (p==' ') printf("链表是空的n");
else
{
max=p->data;
p=p->next;
while (p!=' ')
{
if ((p->data)>max) max=p->data;
p=p->next;
}
printf("n链表中最大的数是:%d",max);
return max;
}
}
//查找最大值并返回地址
struct mdt *maxv(struct mdt *head)
{
struct mdt *p,*s;
int max;
p=head->next;
if (p==' ') printf("链表是空的n");
else
{
max=p->data;
s=p;
p=p->next;
while(p!=' ')
{
if ((p->data)>max)
{
max=p->data;
s=p;
}
p=p->next;
}
printf("n链表中最大数的地址是:%ld %ldn",s);
return s;
}
}
void main()
{
struct mdt *head,*maxad;
int max;
head=creat();
print(head);
max=maxvalue(head);
maxad=maxv(head);
}
