//设head指向一个非空单向链表(其数据域值均为正整数)
//输出链表所有结点数据域的值
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
int data;
struct node*next;
}ElemSN;
ElemSN *Createlink(int a[],int n)
{
ElemSN *head=NULL,*np;
for(int i=n-1;i>=0;i--){
np=(ElemSN *)malloc(sizeof(ElemSN));
np->data=a[i];
np->next=head;
head=np;
}
return head;
}
void Print(ElemSN *head)
{
if(head){
printf("%3d",head->data);
Print(head->next);
}
}
int main()
{
int n;
printf("请输入长度:");
scanf("%d",&n);
int *a;
a=(int *)malloc(n*sizeof(int));
for(int i=0;i<n;i++){
scanf("%d",a+i);
}
ElemSN *head=NULL;
head=Createlink(a,n);
Print(head);
return 0;
}
//逆向输出链表所有结点数据域的值
void Print(ElemSN *head)
{
if(head){
Print(head->next);
printf("%3d",head->data);
}
}
//返回链表所有结点的和
int Sum(ElemSN *head)
{
if(!head) return 0;
else{
return Sum(head->next)+head->data;
}
}
//返回链表数据域值为奇数的结点个数
int Countoddnode(ElemSN *head)
{
if(!head) return 0;
else{
return Countoddnode(head->next)+head->data%2;
}
}
//返回最小值
int Min(ElemSN *head)
{ int min;
if(!head->next) min=head->data;
else{
min=Min(head->next);
if(min>head->data){
min=head->data;
}
}
return min;
}
//返回链表数据域值为key的结点地址(设数据域值不重复),若未找到,返回NULL
ElemSN *Findthekey(ElemSN *head,int key)
{
if(head&&head->data!=key){
head=Findthekey(head->next,key);
}
return head;
}
//设数组a有n各元素,通过递归创建有n个结点的链表
ElemSN *Createlink(int a[],int n)
{
ElemSN *head;
if(n==0){
return NULL;
}
else{
head=(ElemSN *)malloc(sizeof(ElemSN));
head->data=a[0];
head->next=Createlink(a+1,n-1);
return head;
}
}