标签:sim ati queue which end blank private only led
https://leetcode.com/problems/implement-queue-using-stacks/
Implement the following operations of a queue using stacks.
Example:
MyQueue queue = new MyQueue(); queue.push(1); queue.push(2); queue.peek(); // returns 1 queue.pop(); // returns 1 queue.empty(); // returns false
Notes:
push to top
, peek/pop from top
, size
, and is empty
operations are valid.代码:
class MyQueue { public: /** Initialize your data structure here. */ MyQueue() {} /** Push element x to the back of queue. */ void push(int x) { q.push(x); } /** Removes the element from in front of queue and returns that element. */ int pop() { int t = q.front(); q.pop(); return t; } /** Get the front element. */ int peek() { if(!q.empty()) return q.front(); return 0; } /** Returns whether the queue is empty. */ bool empty() { if(q.size() == 0) return true; return false; } private: queue<int> q; }; /** * Your MyQueue object will be instantiated and called as such: * MyQueue obj = new MyQueue(); * obj.push(x); * int param_2 = obj.pop(); * int param_3 = obj.peek(); * bool param_4 = obj.empty(); */
昨天写过一个这样类似的题目啦
#Leetcode# 232. Implement Queue using Stacks
标签:sim ati queue which end blank private only led
原文地址:https://www.cnblogs.com/zlrrrr/p/10043907.html