单向链表的操作

#include "stdio.h"

#include "malloc.h"

struct Node* current = NULL; //声明的一个全局变量表示的是链表的尾部

struct Node

{

int value;

struct Node* next; //下一个节点

};

void addNode(struct Node *node) //添加一个节点

{

current->next = node;

current = current->next;

}

void readNode(struct Node *first) //遍历链表

{

struct Node* temp = first;

while(temp != NULL)

{

printf("%d\n", temp->value);

temp = temp->next;

}

}

int main()

{

struct Node* first = (struct Node*)malloc(sizeof(struct Node));

first->value = 1;

first->next = NULL;

current = first;

struct Node* node = (struct Node*)malloc(sizeof(struct Node));

node->value = 2;

node->next = NULL;

addNode(node);

node = (struct Node*)malloc(sizeof(struct Node));

node->value = 3;

node->next = NULL;

addNode(node);

node = (struct Node*)malloc(sizeof(struct Node));

node->value = 4;

node->next = NULL;

addNode(node);

readNode(first);

getchar();

return 0;

}