Leetcode 32. Longest Valid Parentheses

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.

Example 1:

Input: "(()"
Output: 2
Explanation: The longest valid parentheses substring is "()"

Example 2:

Input: ")()())"
Output: 4
Explanation: The longest valid parentheses substring is "()()"

class Solution {
public:
	int longestValidParentheses(string s)
	{
   		int max = 0;//answer
		stack<char> sk;//答案肯定是偶数
		stack<int> indexs;//防止只有左括号 没有右括号 可以回退 按照左括号位置分割
		int last = s.size();//last是第几个元素 从1开始
		while (last>0&&s[last-1] == '(') 
		{
			last--;
		}
		if (last <= 0)return 0;
		int *dp = new int[last + 1];//包含当前字符的结果值
		dp[0] = 0;
		
		for (int i = 0; i < last; i++) 
		{
			if (s[i] == '(') // 等于左括号的情况
			{
				sk.push(s[i]);
				indexs.push(i);
				dp[i + 1] = dp[i];
			}
			else//等于右括号的情况 
			{
				if (!sk.empty()&&sk.top() == '(') //先判断是否空
				{
					sk.pop();
					indexs.pop();
					dp[i + 1] = dp[i] + 2;
					
					if (sk.empty()) //stack null.update ans("()(()")
					{
						max = max > dp[i + 1] ? max : dp[i + 1];
					}
					
				}
				else if(sk.empty())//NULL 
				{
					dp[i + 1] = 0;
					
				}
			}
			//cout<<dp[i+1]<<" "<<max<<" "<<sk.size()<<endl;
		}
		int v_max = 0;
		int index = last;
		
		while (!sk.empty()) 
		{
			//cout << dp[index] << endl;
			dp[index] = dp[index] - dp[indexs.top() + 1];

			//cout << indexs.top() + 1 << endl;
			//cout << dp[index] << endl;
			int t = indexs.top();
			sk.pop();
			indexs.pop();
			v_max = v_max > dp[index] ?v_max:dp[index];
			//cout<<v_max<<endl;
			index = t+1;
		}
		max = max > v_max? max :v_max;//("(()")
		delete []dp;
		dp = nullptr;
		return max;
	}
};

解法：右括号要考虑的很基础不多说了，要考虑左括号的情况，因为左括号肯定入栈，但不知道左括号是不是正确的字串，所以为了能够回滚，把左括号的index和本身全部入站，通过左括号分割来回滚结果，还有一种要考虑的就是，最右边的左括号提前删掉，不然会影响最终结果。