剑指 Offer 09. 用两个栈实现队列
题意:如题目
思路:纯模拟(懒惰如我,其实是用的数组x)
364ms(45%) 101.9M(28%)
class CQueue {
int head,tail,num[10000+5];
public:
CQueue() {
head=0;tail=0;
}
void appendTail(int value) {
num[tail++]=value;
}
int deleteHead() {
if(tail>head)
return num[head++];
else return -1;
}
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/