编辑代码

//链表中的结点结构
typedef struct lineStack
{
    int data;
    struct lineStack *next;
}lineStack;
//stack为当前的链栈，a表示入栈元素
lineStack* push(lineStack *stack,int a)
{
    //创建存储新元素的结点
    lineStack * line =(lineStack*)malloc(sizeof(lineStack));
    line->data = a;
    //新节点与头结点建立逻辑关系
    line->next = stack;
    //更新头指针
    stack = line;
    return stack;
}