简单链表

#include<iostream>
struct ListNode{
int val;
ListNode* next;
};
struct List{
ListNode *head;
};
void initList(ListNode** phead){
ListNode* node=new ListNode();
node->val=-1;
node->next=NULL;
*phead=node;
}
void addList(ListNode** phead, int value){
ListNode* node = new ListNode();
node->val=value;
node->next=NULL;

ListNode* p=(*phead);
while(p->next != NULL)
p=p->next;
p->next=node;
}

int main(){
List alist;
initList(&alist.head);

addList(&alist.head,2);
addList(&alist.head,6);
addList(&alist.head,3);

ListNode* p=alist.head;
while(p){
std::cout<<p->val<<" ";
p=p->next;
}
std::cout<<std::endl;
return 0;
}