C language Learning--linked list

#include"node.h"#include<stdio.h>#include<stdlib.h>//typedef struct _NODE {//int value;//struct _node *next;//} Node;intMainintAGRC,Char Const*argv[]) {    intNumber ; Node* head =NULL;  Do{scanf ("%d",&Number ); if(Number! =-1) {            //Add to link listNode *p = (node*)malloc(sizeof(Node)); P->value =Number ; P->next =NULL; //Finde The lastNode *last =Head; if(last) { while(last->next) { Last= last->Next; } Last->next =p; } Else{Head=p; }        }            } while(Number! =-1); return 0;}

After joining list

#include"node.h"#include<stdio.h>#include<stdlib.h>//typedef struct _NODE {//int value;//struct _node *next;//} Node;typedefstruct_list {Node*Head;} List;voidAdd (list* pList,intNumber );intMainintargcChar Const*argv[]) {    intNumber ;    List List; List.head=NULL;  Do{scanf ("%d",&Number ); Add (&list,number); }  while(Number! =-1); return 0;}voidAdd (list* pList,intNumber ) {     while(Number! =-1) {            //Add to Link-listNode *p = (node*)malloc(sizeof(Node)); P->value =Number ; P->next =NULL; //Find the lastNode *last = plist->Head; if(last) { while(last->next) {                //AttachLast = last->Next; } Last->next =p; } Else{pList->head =p; }            }    }

C language Learning--linked list