Leetcode225. 用队列实现栈(C语言)
数据结构-栈和队列:算法与数据结构参考
题目:
使用队列实现栈的下列操作:
push(x) – 元素 x 入栈
pop() – 移除栈顶元素
top() – 获取栈顶元素
empty() – 返回栈是否为空
输入:[“MyStack”,“push”,“push”,“top”,“pop”,“empty”]
[[],[1],[2],[],[],[]]
输出:[null,null,null,2,2,false]
思路:
重点在栈的结构:栈顶指针,存储元素的数组。
代码:
typedef struct {
int top;
int *arr;
} MyStack;
/** Initialize your data structure here. */
MyStack* myStackCreate() { //初始化一个栈,注意区别obj和arr
MyStack *obj=malloc(sizeof(MyStack));
obj->top=-1;
obj->arr=(int*)malloc(1024*sizeof(int));
return obj;
}
/** Push element x onto stack. */
void myStackPush(MyStack* obj, int x) {
obj->top++;
obj->arr[obj->top]=x;
}
/** Removes the element on top of the stack and returns that element. */
int myStackPop(MyStack* obj) {
int tmp=obj->arr[obj->top];
obj->top--;
return tmp;
}
/** Get the top element. */
int myStackTop(MyStack* obj) {
return obj->arr[obj->top];
}
/** Returns whether the stack is empty. */
bool myStackEmpty(MyStack* obj) {
if(obj->top==-1) return true;
else return false;
}
void myStackFree(MyStack* obj) {
free(obj);
}
/**
* Your MyStack struct will be instantiated and called as such:
* MyStack* obj = myStackCreate();
* myStackPush(obj, x);
* int param_2 = myStackPop(obj);
* int param_3 = myStackTop(obj);
* bool param_4 = myStackEmpty(obj);
* myStackFree(obj);
*/