Get the App
SLTechnology News&Howtos  ›  Development  › 

How to realize Stack in programming Development

Shulou Source: shulou.com Published: 2022-06-03 02:33:38 10月13日 Update

This article mainly introduces how to implement the stack in programming development, which has a certain reference value. Interested friends can refer to it. I hope you will gain a lot after reading this article.

/ * * WZ ASUST 2016 * * / # include using namespace std;const int StackSize=10; template class SeqStack {public: SeqStack (); / / Constructor, initialization of stack ~ SeqStack () / / destructor void Push (T x); / / put the element x into the stack T Pop (); / / pop the top element of the stack out of T GetTop (); / / fetch the top element of the stack (do not delete) bool Empty (); / / determine whether the stack is empty private: t data [StackSize] / / the array int top; / / stack top pointer that stores stack elements, indicating the subscript} of stack top elements in the array; template SeqStack::SeqStack () {top=-1;} template SeqStack::~SeqStack () {} template void SeqStack::Push (T x) {if (top== StackSize-1) throw "overflow"; top++; data [top] = x;} template T SeqStack::Pop () {T x If (top==-1) throw "underflow"; x=data [top--]; return x;} template T SeqStack::GetTop () {if (topical trees return 1) return data [top];} template bool SeqStack::Empty () {if (top==-1) return 1; else return 0;} void test1 () {SeqStack a / / create an instance of the template class if (a.Empty ()) {cout

Tags: Elements articles development programming functions arrays subscript value interest at the same time examples instructions pointers more friends templates knowledge editing industry information Apple Docker Huawei Linux macOS MariaDB Microsoft MySQL NVidia OPPO Reno Shulou Technology Redmi Huawei Shulou Information OPPO Reno