leetcode 32 : 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.

思路: 从字符串第一个字符开始循环

         用 string strStack对 没有匹配的括号压栈

         vector<int> indexVec 记录对应入栈括号在输入字符串的位置

        若字符匹配就出栈，那么当前位置到栈顶元素位置之间的距离 就是匹配距离，栈为空那就说明到目前为止都匹配

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      

using namespace std;

class Solution {
public:
    int longestValidParentheses(string s) {
        string strStack="";
        vector
      
      
       
        indexVec;
        int i=0;
        int ret=0;
        int start=s.size();
        while(i
       
       
         0 ) { if( i-indexVec[indexVec.size()-1] >ret ) { ret=i-indexVec[indexVec.size()-1]; start=indexVec[indexVec.size()-1]+1; } } else//目前为止全部匹配，所以ret=i+1 { ret=i+1; start=0; } } else { strStack.append(1,s[i]); indexVec.push_back(i); } } i++; } return ret; } bool isMatch(char firstChar,char secondChar) { if( firstChar=='(' && secondChar==')' ) return true; else return false; } }; int main() { Solution s; cout< 
        
          <