剑指 Offer 09. 用两个栈实现队列 - 力扣(LeetCode)
代码
class CQueue {
#define scale 0x130A
int* arr;
int front, back;
public:
CQueue() : arr(new int[scale]), front(-1), back(-1) {}
void appendTail(int value) {
arr[++back % scale] = value;
}
int deleteHead() {
return (back + scale - front) % scale ? arr[++front] : -1;
}
};
运行结果