链表

#include<bits/stdc++.h>
using namespace std;
struct stacks
{
    int x;
    struct stacks*next;
} ;
//栈:  插入push() 删除pop() size()大小 top()读
//队列:插入push()                    front读
struct stacks *head,*tail;
int LinklistNum;
int push(int temp)
{
    struct stacks*p;
    p=(struct stacks*)malloc(sizeof(struct stacks));
    if(!p)
        return 0;
    p->next=head;//连通
    p->x=temp;
    head=p;
    LinklistNum++;
    return 1;
}
int pop()
{
    if(head==NULL)
    {
        return 0;
    }
    struct stacks*q;
    q=head;
    head=head->next;
    free(q);
    LinklistNum--;
    return 1;

}
int sizes()
{
    return LinklistNum;
}
int top()
{
    if(head==NULL)
        return -0x3f3f3f3f;
    return head->x;
}
void init()
{
    head=(struct stacks*)malloc(sizeof(struct stacks));
    tail=head;//tail
}
//init初始化
int main()
{
    init();
    push(1);
    push(2);
    push(3);
    for(;sizes();pop())
    {
        printf("%d ",top());
    }
    return 0;
}

PUSH
快捷键
home
end