LeetCode Valid Parentheses

最新推荐文章于 2019-07-31 23:36:17 发布

FightForProgrammer

最新推荐文章于 2019-07-31 23:36:17 发布

阅读量479

点赞数

分类专栏： LeetCode 文章标签： leetcode isValid

本文链接：https://blog.csdn.net/FightForProgrammer/article/details/42061865

版权

LeetCode 专栏收录该内容

44 篇文章 0 订阅

订阅专栏

LeetCode Valid Parentheses

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.

bool isValid(string s) 
{
	if(s.length()==1)
		return false;

	stack<char> sta;
	for(int i=0; i<s.length(); i++)
	{
		if(s[i] == '(' || s[i]=='{' || s[i]=='[')
			sta.push(s[i]);
		else if(sta.size()!=0 && ((sta.top()=='('&&s[i]==')') || (sta.top()=='['&&s[i]==']') || (sta.top()=='{'&&s[i]=='}')))
			{
				sta.pop();
			}
		else
			return false;
	}

	if(sta.size() ==0)
		return true;
	else 
		return false;
}