Longest Valid Parentheses

class Solution{
public:
    int longestValidParentheses(string s){
        stack<int> lefts; // index of left parentheses.
        int len = s.length();
        if(len < 2) return 0;

        int start = -1;
        int res = 0;
        for (int i=0;i<len;i++){
            if(s[i] == ‘(‘){
                lefts.push(i);
            }else{
                if(lefts.empty()){
                    start = i;
                }else{
                    lefts.pop();
                    if(lefts.empty()){
                        res = max(res,i - start);
                    }else{
                        res = max(res,i- lefts.top());
                    }
                }
            }
        }
        return res;
    }
};