<easy>LeetCode Problem -- 155. Min Stack
描述:Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
push(x) – Push element x onto stack.
pop() – Removes the element on top of the stack.
top() – Get ...
原创
2019-01-06 21:40:59 ·
146 阅读 ·
0 评论