Skip to content

Commit 5daf942

Lozakaka Lozakaka

authored

Update 0225.用队列实现栈.md

新增一個java solution用的是卡哥的邏輯

1 parent d2bbea4 commit 5daf942Copy full SHA for 5daf942

File tree

1 file changed

+37

-0

lines changed

problems
- 0225.用队列实现栈.md

1 file changed

+37

-0

lines changed

`‎problems/0225.用队列实现栈.md‎`

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -324,6 +324,43 @@ class MyStack {`
`324`	`324`	`}`
`325`	`325`	`}`
`326`	`326`
	`327`	+```
	`328`	`+优化,使用一个 Queue 实现,但用卡哥的逻辑实现`
	`329`	+```
	`330`	`+class MyStack {`
	`331`	`+ Queue<Integer> queue;`
	`332`	`+`
	`333`	`+ public MyStack() {`
	`334`	`+ queue = new LinkedList<>();`
	`335`	`+ }`
	`336`	`+`
	`337`	`+ public void push(int x) {`
	`338`	`+ queue.add(x);`
	`339`	`+ }`
	`340`	`+`
	`341`	`+ public int pop() {`
	`342`	`+ rePosition();`
	`343`	`+ return queue.poll();`
	`344`	`+ }`
	`345`	`+`
	`346`	`+ public int top() {`
	`347`	`+ rePosition();`
	`348`	`+ int result = queue.poll();`
	`349`	`+ queue.add(result);`
	`350`	`+ return result;`
	`351`	`+ }`
	`352`	`+`
	`353`	`+ public boolean empty() {`
	`354`	`+ return queue.isEmpty();`
	`355`	`+ }`
	`356`	`+`
	`357`	`+ public void rePosition(){`
	`358`	`+ int size = queue.size();`
	`359`	`+ size--;`
	`360`	`+ while(size-->0)`
	`361`	`+ queue.add(queue.poll());`
	`362`	`+ }`
	`363`	`+}`
`327`	`364`	```
`328`	`365`
`329`	`366`	`Python:`

0 commit comments

Comments

(0)