c语言实现的链表

	
#include	<stdio.h>
#include	<string.h>
#include	<stdlib.h>
#include	<memory.h>
#include	<malloc.h>


typedef struct node {
	char data[1024];
	struct node * next;
} Node;

Node* InitList(char[]) ;
void printNode(Node *);
void AddNode(Node *, char* );

int main( void )
{
	int i =99;
	Node * pHead;
	pHead = InitList("1000001\n");

	char temp[512];
	sprintf(temp,"0111111%dA",i);
	AddNode(pHead,temp);
	AddNode(pHead,"111111\n");
	AddNode(pHead,"2222211222\n");
	AddNode(pHead,"3333333\n");
	AddNode(pHead,"4444444444\n");

	printNode(pHead);

	return 0;
	}


Node* InitList(char trailData[]) {
	Node * head = (Node * )malloc(sizeof(Node));
	memset(head->data,0x00,sizeof(head->data));
	strcpy(head->data,trailData);
	head->next = NULL;
	return head;
}


void printNode(Node *head){
    Node *p;
	if(head->data){
	   printf("%s\n",head->data);
	}

	p = head->next;
	while(p != NULL){
	    printf("%s\n",p->data);
	        p = p->next;
	}
	return;
}

void AddNode(Node *head, char trailData[]) {
	Node *currentNode, *newNode, *next;
	currentNode = head;
	next = head->next;

	while (next != NULL) {
		currentNode = next;
		next = next->next;
	}
	
	newNode = (Node * )malloc(sizeof(Node));
	memset(newNode , 0x00,sizeof(newNode));
	strcpy(newNode->data,trailData);

	currentNode->next = newNode;
	return;
}

gcc -Wall test.c -o test

run ./test