Leetcode:Longest Valid Parentheses
来源:互联网 发布:判断素数的条件c语言 编辑:程序博客网 时间:2024/05/01 21:59
Longest Valid Parentheses
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.
public class Solution { public int longestValidParentheses(String s) { if (s == null) { return 0; } Stack<Integer> stack = new Stack<Integer>(); int maxLen = 0; int accumulatedLen = 0; for(int i = 0; i < s.length(); i++) { if (s.charAt(i) == '(') { stack.push(i); } else { if (stack.isEmpty()) { accumulatedLen = 0; } else { int matchedPos = stack.pop(); int matchedLen = i - matchedPos + 1; if (stack.isEmpty()) { accumulatedLen += matchedLen; matchedLen = accumulatedLen; } else { matchedLen = i - stack.peek(); } maxLen = Math.max(maxLen, matchedLen); } } } return maxLen; }}
0 0
- LeetCode: Longest Valid Parentheses
- LeetCode Longest Valid Parentheses
- LeetCode: Longest Valid Parentheses
- [Leetcode] Longest Valid Parentheses
- [leetcode]longest Valid Parentheses(!!)
- [Leetcode] Longest Valid Parentheses
- leetcode Longest Valid Parentheses
- 【leetcode】Longest Valid Parentheses
- [LeetCode]Longest Valid Parentheses
- [leetcode] Longest Valid Parentheses
- LeetCode-Longest Valid Parentheses
- [LeetCode] Longest Valid Parentheses
- LeetCode:Longest Valid Parentheses
- Leetcode: Longest Valid Parentheses
- Leetcode:Longest Valid Parentheses
- leetcode Longest Valid Parentheses
- leetcode Longest Valid Parentheses
- LeetCode Longest Valid Parentheses
- php将两个数组相同的key合并到一个数组
- Java 工厂模式简单运用
- sed 用法
- @MappedSuperclass
- Oracle自带的用户
- Leetcode:Longest Valid Parentheses
- 黑马程序员——6、OC语言(基本语法)
- 转载将多个工程打包成一个apk
- Dex文件的内存映射
- 使用QUdpSocket进行UDP编程
- android学习笔记之说说drawable目录下的xml
- 项目组成员工作积极性变高了
- Bootstrap 自定义分页方法
- Java异常