Leetcode刷题笔记(c++)_热题 HOT 100_32. 最长有效括号

暴力解

class Solution {
public:
    int longestValidParentheses(string s) {
        if(s.empty())return 0;
        stack<pair<char,int>>t;
        for(int i=0;i<s.size();i++){
            if(t.empty())t.push({s[i],i});
            else if(t.top().first=='('&&s[i]==')')t.pop();
            else t.push({s[i],i});
        }
        if(t.empty())return s.size();
        int temp=s.size()-1,out=0;
        while(!t.empty()){
            out=max(out,temp-t.top().second);
            temp=t.top().second-1;
            t.pop();
        }
        out=max(out,temp+1);
        return out;
    }
};