LeetCode 155最小栈: 无额外占用空间-储存差值 ｜Min Stack with No extra space-Store as Difference
摘要：
In Min Stack problem, usually we need another stack to store each min value. But we can store the difference between min value and the pushing value. So one minValue var can construct the whole origin stack. 阅读全文
posted @ 2022-06-22 22:36 liuzhch1 阅读(41) 评论(0) 推荐(0) 编辑
