单向循环链表

#include<stdio.h>
#include<stdlib.h>
typedef struct node{
int data;
struct node *next;
}ElemSN;

ElemSN *Creatlink(int a[],int n);
void Printlink(ElemSN *h);

int main(void)
{
int a[6]={3,2,5,8,4,7};
ElemSN *head;
//创建循环链表
head=Creatlink(a,6);
//输出
Printlink(head);
printf("\n");
}

ElemSN *Creatlink(int a[],int n)
{
ElemSN *h,*p,*t;
int i;
h=NULL;
for(i=0;i<n;i++)
{
p=(ElemSN *)malloc(sizeof(ElemSN));
p->data=a[i];
if(!h)
{
p->next=p;
h=t=p;
}
else
{
p->next=h;
t=t->next=p;
}
}
return h;
}

void Printlink(ElemSN *h)
{
ElemSN*p;
p=h;
do{
printf("%5d",p->data);
p=p->next;
}while(p!=h);
}

转载于:https://www.cnblogs.com/laziya/p/9696195.html