Longest Valid Parentheses

来源:互联网 发布:金融专业 知乎 编辑:程序博客网 时间:2024/06/05 07:22

http://www.cnblogs.com/lichen782/p/leetcode_Longest_Valid_Parentheses.html


class Solution {public:    int longestValidParentheses(string s) {        vector<int> stack;        int last = -1, maxlen = 0;        for(int i = 0; i < s.size(); i++) {            if(s[i] == '(') {                stack.push_back(i);            } else {                if(stack.empty())                  last = i;                else {                    stack.pop_back();                    if(stack.empty())                      maxlen = max(maxlen, i - last);                    else                      maxlen = max(maxlen, i - stack.back());                }            }        }        return maxlen;    }};


0 0
原创粉丝点击