带头结点的链表

#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, * p;

h=p=(ElemSN *)malloc(sizeof(ElemSN));

h->next=NULL;

for( i=0;i<N;i++){

p=p->next=(ElemSN *)malloc(sizeof(ElemSN));

p->data =a[i];

p->next=NULL;

}

return h;

}

void printlink(ElemSN * h){

ElemSN * p;

for(p=h;p->next;p=p->next)

printf("%2d\n",p->next->data);

}

int main(void){

int a[N]={1,2,3,4,5,6,7,8,9};

ElemSN * head;

head=Createlink(a,9);

printlink(head);

}

原文地址：http://blog.51cto.com/13645380/2154801