225. 用队列实现栈【Queue类–LinkedList集合、queue1.offer()、poll()、peek()】

225. 用队列实现栈

---

C代码：一个队列

typedef struct {
    int queue[100];
    int front;
    int rear;
} MyStack;

MyStack* myStackCreate() {
    MyStack* stack = (MyStack*)malloc(sizeof(MyStack));
    stack->front = 0;
    stack->rear = 0;
    return stack;
}

void myStackPush(MyStack* obj, int x) {
    obj->queue[obj->rear++] = x;
}

int myStackPop(MyStack* obj) {
    // 优化：复制指针，减少对内存的访问次数
    int front = obj->front;
    int rear = obj->rear;

    // 将队列头部的元素（除了最后一个元素外）重新添加到队列尾部
    int size = rear - front;
    while (size-- > 1) {
        obj->queue[rear++] = obj->queue[front++];
    }
    // 弹出此时的一个元素（即原来的最后一个元素）并保存
    int top = obj->queue[front++];

    // 更新队首队尾指针
    obj->front = front;
    obj->rear = rear;

    // 返回栈顶指针
    return top;
}

// 返回队列末尾的元素
int myStackTop(MyStack* obj) {
    return obj->queue[obj->rear - 1];
}

// 若队首队尾指针相等，则队列为空，即栈为空
bool myStackEmpty(MyStack* obj) {
    return obj->rear == obj->front;
}

// 将队首队尾指针都归 0
void myStackFree(MyStack* obj) {
    obj->front = 0;
    obj->rear = 0;
}

---

Java代码：两个队列Queue

class MyStack {
    Queue<Integer> queue1;
    Queue<Integer> queue2;
    public MyStack() {
        //LinkedList 在任何位置高效插入和删除的有序序列
        queue1 = new LinkedList<Integer>();  //LinkedList是一种集合类型
        queue2 = new LinkedList<Integer>();
    }
    
    public void push(int x) {
        queue2.offer(x);  //新添加值到queue2开头，last in first out
        while (!queue1.isEmpty()) {
            queue2.offer(queue1.poll()); //1队列头的元素 剪切到2的队列中
        }
        Queue<Integer> temp = queue1; //把que2的值全部放到que1，que2作为一个中转站
        queue1 = queue2;
        queue2 = temp;
    }
    
    public int pop() {
         return queue1.poll();  //poll()
    }
    
    public int top() {
        return queue1.peek();
    }
    
    public boolean empty() {
        return queue1.isEmpty();
    }
}

---

Java代码：一个队列

class MyStack {
    Queue<Integer> queue;

    public MyStack() {
        queue = new LinkedList<Integer>();
    }

    public void push(int x) {
        int n = queue.size();
        queue.offer(x);
        for (int i = 0; i < n; i++) {
            queue.offer(queue.poll());  // 妙啊！last in first out
        }
    }

    public int pop() {
        return queue.poll();
    }

    public int top() {
        return queue.peek();
    }

    public boolean empty() {
        return queue.isEmpty();
    }
}

/**
 * Your MyStack object will be instantiated and called as such:
 * MyStack obj = new MyStack();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.top();
 * boolean param_4 = obj.empty();
 */