首先定义初始条件
typedef struct Node{
int val;
struct Node *next;
}Node, *LinkedList;
LinkedList HasHeadNodeIntiListAtEnd();
LinkedList HasHeadNodeIntiListAtStart();
LinkedList NoHeadNodeIntiListAtStart();
LinkedList NoHeadNodeIntiListAtEnd();
①无头结点的表尾插入法
LinkedList NoHeadNodeIntiListAtEnd(){
LinkedList prev, current, head;
int firstNodeVal;
//首先判断第一个值有没有输入,若没有则直接返回结点
if(scanf("%d", &firstNodeVal) != EOF){
prev = (LinkedList)malloc(sizeof(Node