Longest Valid Parentheses

最新推荐文章于 2019-10-09 18:26:29 发布

Nereus_Li

最新推荐文章于 2019-10-09 18:26:29 发布

阅读量559

点赞数

分类专栏： LeetCode 文章标签： DP

本文链接：https://blog.csdn.net/li_chihang/article/details/44829041

版权

LeetCode 专栏收录该内容

113 篇文章 0 订阅

订阅专栏

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.

int longestValidParentheses(string s) {
	if (s.empty())
		return 0;
	int max =0;
	vector<int>Maxlength(s.size(),0);
	for (int i = Maxlength.size()-2;i>=0;--i)
	{
		if (s[i]=='(')
		{
			int j = i+1+Maxlength[i+1];
			if (j<s.size()&&s[j]==')')
			{
				Maxlength[i] = Maxlength[i+1]+2;
				if (j+1<s.size())
					Maxlength[i]+=Maxlength[j+1];
			}
		}
		max =max<=Maxlength[i]?Maxlength[i]:max;
	}
	return max;
}

int longestValidParentheses(string s) {
	if (s.empty())
		return 0;
	stack<int>CharStack;
	CharStack.push(-1);
	int length =0;
	int longestlength =0;
	for (int i = 0;i!=s.size();++i)
	{
		if (s[i]=='(')
			CharStack.push(i);
		else if (s[i]==')')
		{
			if (CharStack.size()>1)
			{
				CharStack.pop();
				length=i-CharStack.top();
				longestlength =max(longestlength,length);
				
			}
			else{
				CharStack.pop();
				CharStack.push(i);
			}
		}
	}
	return longestlength;
}