Leetcode longest valid parentheses

class Solution {public:    int longestValidParentheses(string s) {        vector<int> stack;        int maxlen = 0;        int curlen = 0;        int last = -1;        int len = s.length();        for (int i=0; i<len; i++) {            char ch = s[i];            if (ch == ‘(‘) {                stack.push_back(i);                continue;            }            if (stack.empty()) {                last = i;                continue;            }            stack.pop_back();            if (stack.empty()) {                curlen = i - last;            } else {                curlen = i - stack.back();            }                        if (curlen > maxlen) maxlen = curlen;        }                return maxlen;    }};

Reference: http://www.cnblogs.com/zhuli19901106/p/3547419.html

Last is used to record the position of the last unmatching right parenthesis. When the stack is empty, a valid sequence of parentheses is bound, and the start of the sequence must be a position after the last one.

I have a limited IQ. I have been doing this for a long time. I only have to look at the answer...