Commit9a4c92d

committed

225-implement-stack-using-queues.md Added Follow-up solution of Chinese.

1 parent93f6c41 commit9a4c92dCopy full SHA for 9a4c92d

File tree

-0

lines changed

-0

lines changed

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -46,6 +46,15 @@ myStack.empty(); // 返回 False`
`46`	`46`	`###[进阶]`
`47`	`47`	`你能否仅用一个队列来实现栈？`
`48`	`48`
	`49`	`+<details>`
	`50`	`+ <summary>解法提示</summary>`
	`51`	`+可以只用一个队列。`
	`52`	`+<br>`
	`53`	+改动只在`push`方法。只需要想办法不借助另一个`queue_temp`，把`x`插入到队列的头部。
	`54`	`+<br>`
	`55`	+在实现`push`方法时，先`queue.push(x)`，然后，执行`queue.length - 1`次`value = queue.pop(); queue.push(value)`即可。
	`56`	`+</details>`
	`57`	`+`
`49`	`58`	`#中文题解`
`50`	`59`	`##思路`
`51`	`60`	`1. 使用的两个队列，一个队列用于输入和输出，另一个队列用于临时存储。`

Comments

(0)