我把他全部丟進第二個stack
然後他就會倒過來
然後把上面的丟掉
然後再塞回去
感覺好麻煩喔= =
然後那個MyQueue()是在幹嘛的阿
我不知道他是什麼
class MyQueue {
public:
vector<int> stack1;
vector<int> stack2;
MyQueue()
{
vector<int> stack1;
vector<int> stack2;
}
void push(int x)
{
stack1.push_back(x);
}
int pop()
{
while(!stack1.empty())
{
stack2.push_back(stack1.back());
stack1.pop_back();
}
int k = stack2.back();
stack2.pop_back();
while(!stack2.empty())
{
stack1.push_back(stack2.back());
stack2.pop_back();
}
return k;
}
int peek()
{
while(!stack1.empty())
{
stack2.push_back(stack1.back());
stack1.pop_back();
}
int k = stack2.back();
while(!stack2.empty())
{
stack1.push_back(stack2.back());
stack2.pop_back();
}
return k;
}
bool empty()
{
return stack1.empty();
}
};