32. Longest Valid Parentheses
2016-11-21 14:44
225 查看
class Solution {
public:
int longestValidParentheses(string s) {
//使用DP，vector<int> res(s.size()), res[i]代表从s[j->i]的匹配圆括号数目
int n = s.size();
if(n<=1)
return 0;
vector<int> res(n,0);
int open=0, max=0;
for(int i=0; i<n; i++)
{
if(s[i]=='(')
open++;
else if(s[i]==')' && open>0)
{
res[i] = res[i-1]+2;
open--;
if(i-res[i]>0)
res[i] += res[i-res[i]];
if(res[i]>max)
max = res[i];
}
}
return max;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 32. Longest Valid Parentheses
- Leetcode 32. Longest Valid Parentheses (Hard) (cpp)
- leetcode 32. Longest Valid Parentheses 最长有效括号长度
- LeetCode 32. Longest Valid Parentheses（最长有效括号）
- 个人记录-LeetCode 32. Longest Valid Parentheses
- LeetCode Algorithms 32. Longest Valid Parentheses 题解
- leetcode: 32. Longest Valid Parentheses [✗]
- LeetCode 32. Longest Valid Parentheses (Hard)
- leetcode 32. Longest Valid Parentheses
- LeetCode----32. Longest Valid Parentheses(最长有效括号)
- 32. Longest Valid Parentheses
- 32. Longest Valid Parentheses
- 32. Longest Valid Parentheses
- 32. Longest Valid Parentheses 动态规划解法
- 32. Longest Valid Parentheses（最长括号匹配，hard）
- LeetCode 32. Longest Valid Parentheses(hard)
- 【栈/DP】LeetCode 32. Longest Valid Parentheses 八种解法
- 32. Longest Valid Parentheses
- LeetCode Algorithms 32. Longest Valid Parentheses
- 32. Longest Valid Parentheses