#include <stdio.h> #define null 0 #define maxSize 5 //存放栈内元素 data[maxSize]; //栈顶指针 int top = -1; void push(int e){ if(top+1 < maxSize){ data[++top] = e; printf("push %d \n",e); }else{ printf("stack is full\n"); } } void pop(){ if(top > -1){ printf("%d poped\n",data[top--]); }else{ printf("stack is empty\n"); } } int main(){ push(1); push(2); push(3); push(4); push(5); push(6); pop(); pop(); pop(); pop(); pop(); pop(); return 0; }
简单的栈
猜你喜欢
转载自wudikua123.iteye.com/blog/1490772
今日推荐
周排行