- 解决环的问题，通常都使用快慢双指针
- 证明有环：慢指针走一步，快指针走两步，若最终重合，证明有环
- 寻找下一个最低点或下一个最高点
- 维护一个存储下标的单调栈
- 保持栈中下标对应的数组值是单调递增或递减的
- 维持字典序
- 维护字典序的单调栈
-
Notifications
You must be signed in to change notification settings - Fork 0
SarahChenJieyi/leetgo
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published