Leetcode 32 Longest Valid Parentheses

哀酱

于 2018-09-10 22:42:08 发布

阅读量165

点赞数

分类专栏： LeetCode(c++&python)

本文链接：https://blog.youkuaiyun.com/u010821666/article/details/82597543

版权

LeetCode(c++&python) 专栏收录该内容

136 篇文章

订阅专栏

Leetcode 32 Longest Valid Parentheses

class Solution{
public:
    int longestValidParentheses(string s) {
        int n = s.length(), result = 0;
        vector<int> dp(n+1);
    for(int i = 1;i < n; ++i){
      if(s[i] == ')'){
       if(s[i-1] == '('){
         dp[i+1] = dp[i-1] + 2;  
       } else {
        if(s[i - dp[i] -1] == '(')
          dp[i+1] = dp[i] + dp[i-dp[i]-1] + 2;
       }
      result = max(result,dp[i+1]);
      }
    }
    return result;
    }
};