stack
HELLO_蓝猫
这个作者很懒,什么都没留下…
展开
-
Leetcode 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 the ...原创 2018-06-27 09:50:19 · 146 阅读 · 0 评论 -
Leetcode 32. Longest Valid Parentheses
Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring. Example 1: Input: "(()" Output: 2 Explanation: The longest valid...原创 2019-06-19 16:17:12 · 184 阅读 · 0 评论