堆栈

堆栈
#include<iostream>
#define maxsize 1000
using namespace std;
typedef struct SNode*Stack;//栈的顺序存储结构
struct SNode {
    int data[maxsize];
    int top;//栈顶元素
};
void Push(Stack Ptrs, int item)//入栈
{
    if (Ptrs->top = maxsize - 1)
    {
        cout << "堆栈满了" << endl;
        return;
    }
    else
    {
        Ptrs->data[++(Ptrs->top)] = item;//栈顶元素增加
        return;
    }
}
int Pop(Stack Ptrs)//出栈  
{
    if (Ptrs->top == -1)
    {
        cout << "栈空" << endl;
        return -1;
    }
    else
    {
        Ptrs->top--;
        return Ptrs->data[Ptrs->top];
    }
}

 

转载于:https://www.cnblogs.com/h694879357/p/11471367.html