[Leetcode] #20 Valid Parentheses

最新推荐文章于 2020-03-04 16:26:16 发布

努力的小陶

最新推荐文章于 2020-03-04 16:26:16 发布

阅读量198

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_34264472/article/details/55096854

版权

LeetCode 专栏收录该内容

117 篇文章 0 订阅

订阅专栏

Discription:

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.

Solution:

bool isValid1(string s) {
	stack<char> stack;
	for (int i = 0; i < s.size(); i++){
		if (s[i] == '{' || s[i] == '(' || s[i] == '['){
			stack.push(s[i]);
		}
		if (s[i] == '}' || s[i] == ')' || s[i] == ']'){
			if (stack.empty()) return false;
			char temp = stack.top();
			stack.pop();
			if (temp == '{' && s[i] != '}' ||
				temp == '(' && s[i] != ')' ||
				temp == '[' && s[i] != ']')
				return false;
		}
	}
	return stack.empty();
}

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