oj链接:232. 用栈实现队列 - 力扣(LeetCode)
请你仅使用两个栈实现先入先出队列。队列应当支持一般队列支持的所有操作(push
、pop
、peek
、empty
):
实现 MyQueue
类:
void push(int x)
将元素 x 推到队列的末尾int pop()
从队列的开头移除并返回元素int peek()
返回队列开头的元素boolean empty()
如果队列为空,返回true
;否则,返回false
说明:
- 你 只能 使用标准的栈操作 —— 也就是只有
push to top
,peek/pop from top
,size
, 和is empty
操作是合法的。 - 你所使用的语言也许不支持栈。你可以使用 list 或者 deque(双端队列)来模拟一个栈,只要是标准的栈操作即可。
示例 1:
输入: ["MyQueue", "push", "push", "peek", "pop", "empty"] [[], [1], [2], [], [], []] 输出: [null, null, null, 1, 1, false] 解释: MyQueue myQueue = new MyQueue(); myQueue.push(1); // queue is: [1] myQueue.push(2); // queue is: [1, 2] (leftmost is front of the queue) myQueue.peek(); // return 1 myQueue.pop(); // return 1, queue is [2] myQueue.empty(); // return false
提示:
1 <= x <= 9
- 最多调用
100
次push
、pop
、peek
和empty
- 假设所有操作都是有效的 (例如,一个空的队列不会调用
pop
或者peek
操作)
进阶:
- 你能否实现每个操作均摊时间复杂度为
O(1)
的队列?换句话说,执行n
个操作的总时间复杂度为O(n)
,即使其中一个操作可能花费较长时间。
栈
typedef int STDatatype;
struct stack
{
STDatatype* arr;
int top;
int capacity;
};
typedef struct stack ST;
void STInit(ST* ps);//初始化
void STDestory(ST* ps);//销毁
void STPush(ST* ps, STDatatype x);//压栈
void STPop(ST* ps);//出栈;
STDatatype STTop(ST* ps);//栈顶的数
int STSize(ST* ps);//栈的大小
bool STEmpty(ST* ps);
void STInit(ST* ps)
{
assert(ps);
ps->arr = NULL;
ps->top = 0;
ps->capacity = 0;
}
void STDestory(ST* ps)
{
assert(ps);
free(ps->arr);
ps->arr = NULL;
ps->top = 0;
ps->capacity = 0;
}
void STPush(ST* ps, STDatatype x)
{
assert(ps);
//满了扩容
if (ps->top == ps->capacity)
{
int newcapacity;
if (ps->capacity == 0)
{
newcapacity = 4;
}
else
{
newcapacity = 2 * ps->capacity;
}
STDatatype* temp = (STDatatype*)realloc(ps->arr, newcapacity * sizeof(STDatatype));
if (temp == NULL)
{
perror("realloc fail!");
return;
}
ps->arr = temp;
ps->capacity = newcapacity;
}
ps->arr[ps->top] = x;
ps->top++;
}
void STPop(ST* ps)
{
assert(ps);
ps->top--;
}
STDatatype STTop(ST* ps)
{
assert(ps);
assert(!STEmpty(ps));
return ps->arr[ps->top - 1];
}
int STSize(ST* ps)
{
assert(ps);
return ps->top;
}
bool STEmpty(ST* ps)
{
assert(ps);
return ps->top == 0;
}
完全代码
typedef int STDatatype;
struct stack
{
STDatatype* arr;
int top;
int capacity;
};
typedef struct stack ST;
void STInit(ST* ps);//初始化
void STDestory(ST* ps);//销毁
void STPush(ST* ps, STDatatype x);//压栈
void STPop(ST* ps);//出栈;
STDatatype STTop(ST* ps);//栈顶的数
int STSize(ST* ps);//栈的大小
bool STEmpty(ST* ps);
void STInit(ST* ps)
{
assert(ps);
ps->arr = NULL;
ps->top = 0;
ps->capacity = 0;
}
void STDestory(ST* ps)
{
assert(ps);
free(ps->arr);
ps->arr = NULL;
ps->top = 0;
ps->capacity = 0;
}
void STPush(ST* ps, STDatatype x)
{
assert(ps);
//满了扩容
if (ps->top == ps->capacity)
{
int newcapacity;
if (ps->capacity == 0)
{
newcapacity = 4;
}
else
{
newcapacity = 2 * ps->capacity;
}
STDatatype* temp = (STDatatype*)realloc(ps->arr, newcapacity * sizeof(STDatatype));
if (temp == NULL)
{
perror("realloc fail!");
return;
}
ps->arr = temp;
ps->capacity = newcapacity;
}
ps->arr[ps->top] = x;
ps->top++;
}
void STPop(ST* ps)
{
assert(ps);
ps->top--;
}
STDatatype STTop(ST* ps)
{
assert(ps);
assert(!STEmpty(ps));
return ps->arr[ps->top - 1];
}
int STSize(ST* ps)
{
assert(ps);
return ps->top;
}
bool STEmpty(ST* ps)
{
assert(ps);
return ps->top == 0;
}
typedef struct {
ST pushst;
ST popst;
} MyQueue;
MyQueue* myQueueCreate() {
MyQueue* obj=malloc(sizeof(MyQueue));
STInit(&obj->pushst);
STInit(&obj->popst);
return obj;
}
void myQueuePush(MyQueue* obj, int x) {
STPush(&obj->pushst,x);
}
int myQueuePop(MyQueue* obj) {
int front=myQueuePeek(obj);
STPop(&obj->popst);
return front;
}
int myQueuePeek(MyQueue* obj) {
if(STEmpty(&obj->popst))
{
while(!STEmpty(&obj->pushst))
{
int top=STTop(&obj->pushst);
STPop(&obj->pushst);
STPush(&obj->popst,top);
}
}
return STTop(&obj->popst);
}
bool myQueueEmpty(MyQueue* obj) {
return STEmpty(&obj->pushst) && STEmpty(&obj->popst);
}
void myQueueFree(MyQueue* obj) {
STDestory(&obj->pushst);
STDestory(&obj->popst);
free(obj);
}
/**
* Your MyQueue struct will be instantiated and called as such:
* MyQueue* obj = myQueueCreate();
* myQueuePush(obj, x);
* int param_2 = myQueuePop(obj);
* int param_3 = myQueuePeek(obj);
* bool param_4 = myQueueEmpty(obj);
* myQueueFree(obj);
*/