数据结构—线性表（整表创建）

头插法（表的顺序和之前相反）

void createList_HEAD(List *L,int input[]){    int i = 0 ;    while(input[i]!=-1)    {        position midd = (position)malloc(sizeof(Node));        midd->content = input[i];        midd->next = (*L)->next;        (*L)->next = midd;        i++;    }}

尾插法

void createList_TAIL(List *L,int input[]){    int i = 0 ;    position tail = *L;    while(input[i]!=-1)    {        position midd = (position)malloc(sizeof(Node));        midd->content = input[i];        midd->next = NULL ;        tail->next = midd;        tail = midd;        i++;    }}