栈:
- 栈是一种特殊的线性表,仅能在线性表的一端操作,栈顶允许操作,栈底不允许操作
- 线性表 单端
#include<iostream>
using namespace std;
int stack[100] = {};
int topIndex = 0;
int topNextIndex = 0;
void intoStack(int value){
printf("%s:%d\n", "入栈",value);
topNextIndex = topNextIndex + 1;
topIndex = topNextIndex - 1;
stack[topIndex] = value;
};
void outOfStack(){
printf("%s:%d\n", "出栈", stack[topIndex]);
if (topIndex > 0){
topIndex = topIndex - 1;
}else{
topIndex = topIndex;
}
};
void printStack(){
printf("%s\n", "打印栈:");
for(int i = 0;i <= topIndex;i++){
cout << stack[i] << " " ;
}
cout << endl;
}
void topStack(){
cout << "栈顶元素:" << stack[topIndex] << endl;
};
int main(){
intoStack(1);
intoStack(3);
intoStack(4);
intoStack(5);
intoStack(2);
printStack();
topStack();
intoStack(8);
printStack();
topStack();
outOfStack();
printStack();
topStack();
}
输出结果 - 》》》