#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
int num;
int boxpoint;
struct node *next;
}Node;
typedef Node *List;
void addNode(int a, int boxpoint, List *plist) {
Node * pnew;
Node * scan = *plist;
pnew = (List*)malloc(sizeof(Node));
pnew->boxpoint = boxpoint;
pnew->num = a;
pnew->next = NULL;
if (scan == NULL)
*plist = pnew;//空链表 放头
else
{
while (scan->next != NULL)
scan = scan->next; //找末尾
scan -> next = pnew; //添加到末尾
}
}
void init(List * plist)
{
*plist = NULL;
}
main()
{
List boxs;
//初始化
init(&boxs);
int a = 5;
int boxpoint = 10;
addNode(a, boxpoint, &boxs);
a = 6;
boxpoint = 11;
addNode(a, boxpoint, &boxs);
}