May 15, 2023 · Mar 30, 2023 · Apr 25, 2023 · Apr 28, 2023 · May 15, 2023 · May 15, 2023
diff --git a/problems/0225.用队列实现栈.md b/problems/0225.用队列实现栈.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -324,6 +324,43 @@ class MyStack {
		}
		}

	```
	优化,使用一个 Queue 实现,但用卡哥的逻辑实现
	```
	class MyStack {
	Queue<Integer> queue;

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

	public void push(int x) {
	queue.add(x);
	}

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

	public int top() {
	rePosition();
	int result = queue.poll();
	queue.add(result);
	return result;
	}

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

	public void rePosition(){
	int size = queue.size();
	size--;
	while(size-->0)
	queue.add(queue.poll());
	}
	}
		```

		Python:
Expand Down