循序栈的设计

最新推荐文章于 2025-12-11 14:02:57 发布

原创最新推荐文章于 2025-12-11 14:02:57 发布 · 66 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#数据结构 #c语言 #算法

该代码示例展示了如何在C语言中使用结构体定义顺序栈，并实现初始化、进栈(Push)、出栈(Pop)、获取栈顶元素(GetTop)以及打印栈内容的功能。在主函数中，程序允许用户输入数据创建栈、插入元素、弹出元素及查看栈顶元素。

顺序栈

1. 表头文件

# include<stdio.h>

2. 代码内容

typedef int ElemType;

2.1 定义顺序栈

typedef struct 
{
    ElemType data[MaxSize];
    int top;//栈顶指针，记录了数组的下标
}SqStack;

2.2 初始化

void InitStack(SqStack &S)
{
    S.top = -1;
}

2.3 进栈

bool Push(SqStack &S, ElemType e)
{
    if(S.top == MaxSize-1)   //栈满的情况
    {
        return false;
    }
    S.top = S.top+1;
    S.data[S.top] = e;
    //S.data[++s.top] = e;
    return true;
}

2.4 出栈

bool Pop(SqStack &S, ElemType &e)
{
    if(S.top == MaxSize-1)
    {
        return false;
    }
    S.data[S.top] = e;
    S.top = S.top-1;
    //S.data[S.top--] = e;
    return true;
}

2.5 获取栈顶元素

int GetTop(SqStack S)
{
    return S.data[S.top];
}

2.6 打印顺序栈

void PrintStack(SqStack S)
{
    int i = S.top+1;
    if(S.top != -1)// 判空
    {    
        while(i--)// 遍历顺序栈
        {     
            printf("%d ", S.data[S.top--]);// 从上到下依次遍历
        }
    printf("\n");
    }
    else
    {
        printf("SqStack is empty!\n");
    }
}

2.7 主函数

int main()
{
    SqStack S;
    InitStack(S);
    ElemType e;
    
    
    //创建栈
    int len;
    printf("Please enter the length of data you want to insert!(Length < %d)\n", MaxSize);
    scanf("%d",&len);
    printf("Please enter %d elements one by one in order!\n", len);
    while (len--)
    {
        scanf("%d", &e);
        Push(S, e);
    }
    PrintStack(S);
    
    
    //入栈
    printf("please input the element you want to input to the stack\n");
    scanf("%d",&e);
    Push(S,e);
    printf("You have done it!\n");
    PrintStack(S);
    
    
    //出栈
    printf("please input the element you want to out \n");
    Pop(S, e);
    printf("the %d have be POPPED!\n",e);
    PrintStack(S);


    //获取栈顶元素
    printf("the top element is %d",GetTop(S));
    
    return 0;
}

2.完整代码

//顺序栈
#include<stdio.h>

#define MaxSize 10
typedef int ElemType;

typedef struct 
{
    ElemType data[MaxSize];
    int top;//栈顶指针，记录了数组的下标
}SqStack;

//初始化
void InitStack(SqStack &S)
{
    S.top = -1;
}


//进栈
bool Push(SqStack &S, ElemType e)
{
    if(S.top == MaxSize-1)   //栈满的情况
    {
        return false;
    }
    S.top = S.top+1;
    S.data[S.top] = e;
    //S.data[++s.top] = e;
    return true;
}

//出栈
bool Pop(SqStack &S, ElemType &e)
{
    if(S.top == MaxSize-1)
    {
        return false;
    }
    S.data[S.top] = e;
    S.top = S.top-1;
    //S.data[S.top--] = e;
    return true;
}

//获取栈顶元素
int GetTop(SqStack S)
{
    return S.data[S.top];
}


//输出
void PrintStack(SqStack S)
{
    int i = S.top+1;
    if(S.top != -1)// 判空
    {    
        while(i--)// 遍历顺序栈
        {     
            printf("%d ", S.data[S.top--]); // 从上到下依次遍历
        }
    printf("\n");
    }
    else
    {
        printf("SqStack is empty!\n");
    }
}




int main()
{
    SqStack S;
    InitStack(S);
    ElemType e;
    
    
    //创建栈
    int len;
    printf("Please enter the length of data you want to insert!(Length < %d)\n", MaxSize);
    scanf("%d",&len);
    printf("Please enter %d elements one by one in order!\n", len);
    while (len--)
    {
        scanf("%d", &e);
        Push(S, e);
    }
    PrintStack(S);
    
    
    //入栈
    printf("please input the element you want to input to the stack\n");
    scanf("%d",&e);
    Push(S,e);
    printf("You have done it!\n");
    PrintStack(S);
    
    
    //出栈
    printf("please input the element you want to out \n");
    Pop(S, e);
    printf("the %d have be POPPED!\n",e);
    PrintStack(S);


    //获取栈顶元素
    printf("the top element is %d",GetTop(S));
    
    return 0;
}