鏈表的遍歷-最大值
阿新 • • 發佈：2018-08-02
結點 lib main return std reat -s tdi lin #include<stdio.h>
#include<stdlib.h>
#define N 9
typedef struct node{
int data;
struct node * next;
}ElemSN;
ElemSN * Createlink(int a[],int n){
int i;
ElemSN * h=NULL,* tail, * p;
for( i=0;i<N;i++) {
p=(ElemSN *)malloc(sizeof(ElemSN));
p->data =a[i];
p->next=NULL;
if(!h)
h=tail=p;
else
tail=tail->next=p;
}
return h;
}
ElemSN * Maxnode(ElemSN*h){
ElemSN * Pmax,*p;
Pmax=h;
for(p=h->next;p;p=p->next){
if(Pmax->data<p->data)
Pmax=p;
}
return Pmax;
}
int main(void){
int a[]={1,2,3,4,5,6,7,8,9};
ElemSN * Pmax;
ElemSN *head=NULL;
head=Createlink(a,9);
Pmax=Maxnode(head);
printf("結點最大值=%2d\n",Pmax->data );
}
鏈表的遍歷-最大值