Leetcode235: 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.

很多人会说这道题用动规，可是用动规每次匹配后还要向前到上一个匹配跟这个匹配是否连接，时间复杂度为O(n^2)，其实可以换个想法，用一个bool数组来标记已经匹配过的字符，找到最长的连续标记的长度就是所求的结果。只要遍历两遍数组，时间复杂度为O(n)。

吊炸天！

class Solution {
public:
    int longestValidParentheses(string s) {
        stack<int> ss;
        int n = s.length();
        if(n<2) return 0;
        bool *flag = new bool[n];
        memset(flag, false, n);
        for(int i = 0; i < n; i++)
        {
            if(s[i] == '(') ss.push(i);
            else if(s[i] == ')' && !ss.empty())
            {
                flag[i] = true;
                flag[ss.top()] = true;
                ss.pop();
            }
        }
        int maxlen = 0, curlen = 0;
        for(int i = 0; i < n; i++)
        {
            if(flag[i]) curlen++;
            else    curlen = 0;
            maxlen = max(maxlen, curlen);
        }
        return maxlen;
    }
};