Leetcode||32. Longest Valid Parentheses
来源:互联网 发布:linux vi recording 编辑:程序博客网 时间:2024/06/05 18:52
Given a string containing just the characters '('
and ')'
, find the length of the longest valid (well-formed) parentheses substring.
For "(()"
, the longest valid parentheses substring is "()"
, which has length = 2.
Another example is ")()())"
, where the longest valid parentheses substring is "()()"
, which has length = 4.
用一个栈来存储左括号的索引,遇到正确匹配的括号则弹出匹配的索引,所以栈中存储的是未匹配上的左括号。新匹配上的括号位置到前一段未匹配到的括号的索引差极为有效括号的大小。
class Solution(object): def longestValidParentheses(self, s): """ :type s: str :rtype: int """ stack = [] maxLen = 0 last = -1 for i in range(len(s)): if s[i] == '(': stack.append(i) else: if not stack: last = i else: stack.pop() if not stack: maxLen = max(maxLen, i - last) else: maxLen = max(maxLen, i - stack[-1]) return maxLen
阅读全文
0 0
- LeetCode --- 32. Longest Valid Parentheses
- LeetCode 32.Longest Valid Parentheses
- [Leetcode] 32. Longest Valid Parentheses
- [LeetCode]32.Longest Valid Parentheses
- [leetcode]32.Longest Valid Parentheses
- leetcode 32. Longest Valid Parentheses
- leetcode 32. Longest Valid Parentheses
- LeetCode 32. Longest Valid Parentheses
- [leetcode] 32. Longest Valid Parentheses
- LeetCode 32. Longest Valid Parentheses
- LeetCode-32.Longest Valid Parentheses
- leetcode.32. Longest Valid Parentheses
- 【leetcode】32. Longest Valid Parentheses
- leetcode 32. Longest Valid Parentheses
- [LeetCode] 32. Longest Valid Parentheses
- leetcode 32. Longest Valid Parentheses
- leetcode 32.Longest Valid Parentheses
- leetcode 32. Longest Valid Parentheses
- java对象的创建过程:类的初始化与实例化
- 正则表达式知识整理
- PTA 列车调度(25 分)
- leetcode---recover-binary-search-tree---树
- numpy.zeros()
- Leetcode||32. Longest Valid Parentheses
- Spring Boot集成Swagger2并替换默认的UI
- TS码流解析
- 阿里云发送短信验证码
- 让普通输入框具有Easyui输入框的样式,官方提供
- Spring Boot中使用Swagger2构建强大的RESTful API文档
- 对imageLoader进行配置的方法L
- 前端套路问题
- IT专业人员演变成具有正确DevOps技能的SRE