learning
/
leetcode-master
mirror of https://github.com/youngyangyang04/leetcode-master.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

updaye 0232.用栈实现队列：添加复杂度分析

This commit is contained in:
Yuhao Ju 2023-04-01 12:42:01 +08:00 committed by GitHub
parent eb866901a2
commit 02f9c26f69
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0232.用栈实现队列.md
View File

@ -112,6 +112,10 @@ public:
``` ```
* 时间复杂度: push和empty为O(1), pop和peek为O(n)
* 空间复杂度: O(n)
## 拓展 ## 拓展
可以看出peek()的实现，直接复用了pop()， 要不然，对stOut判空的逻辑又要重写一遍。 可以看出peek()的实现，直接复用了pop()， 要不然，对stOut判空的逻辑又要重写一遍。