#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct node {
int id;
char* name;
struct node* pnext;
}list;
list* getnode(char*name,int id)
{
list* ptemp = malloc(sizeof(list));
ptemp->id = id;
ptemp->name = name;
ptemp->pnext = NULL;
return ptemp;
}
void addnode(list** head, list** end, list* node)
{
//判断链表是否有结点
//传入地址
if (NULL == *head)
{
//如果没有则头指针,尾指针指向结点
*head = node;
*end = node;
}
else
{
//尾结点指针指向新来的结点
//尾指针指向新来的结点
(*end)->pnext = node;
*end = node;
}
}
int main()
{
list* head = NULL;
list* end = NULL;
addnode(&head, &end, getnode("aa", 1));
addnode(&head, &end, getnode("bb" ,2));
while (head != NULL)
{
printf("%s %d\n", head->name, head->id);
head = head->pnext;
}
return 0;
}