链式栈

最新推荐文章于 2024-08-15 17:31:27 发布

谦谦志成

最新推荐文章于 2024-08-15 17:31:27 发布

阅读量86

点赞数

分类专栏： C语言

本文链接：https://blog.csdn.net/register_yewu/article/details/83729478

版权

C语言专栏收录该内容

6 篇文章 0 订阅

订阅专栏

#include "stdio.h"
#include "malloc.h"
typedef struct Node
{
    int info;
    Node *link;
}*PNode;
typedef struct LinkStack
{
    PNode top;
}*PLinkStack;
PLinkStack createEmpty_link()
{
    PLinkStack plastack;
    plastack=(PLinkStack)malloc(sizeof(LinkStack));
    if(plastack!=NULL)
        plastack->top=NULL;
    else
        printf("Out of space!\n");
    return plastack;
}
int isEmptyStack_link(PLinkStack plastack)
{
    return (plastack->top==NULL);
}
void push_link(PLinkStack plastack,int x)
{
    PNode p;
    p=(PNode)malloc(sizeof(Node));
    if(p==NULL)
        printf("Out of space");
    else
    {
        p->info=x;
        p->link=plastack->top;
        plastack->top=p;
    }
}
void pop_link(PLinkStack plastack)
{
    PNode p;
    if(isEmptyStack_link(plastack))
        printf("Empty stack pop.\n");
    else
    {
        p=plastack->top;
        plastack->top=plastack->top->link;
        free(p);
    }
}
int top_link(PLinkStack plastack)
{
    return (plastack->top->info);
}
int main()
{
    PLinkStack plastack;
    int N;
    plastack=createEmpty_link();
    printf("Please input number to N!\n");
    scanf("%d",&N);
    for(int i=0;i<N;i++)
    {
        int x;
        printf("Please input number to x!\n");
        scanf("%d",&x);
        push_link(plastack,x);
    }
    printf("The top number is %d",top_link(plastack));
}