20. Valid Parentheses

最新推荐文章于 2024-11-12 12:29:51 发布

iJulyl

最新推荐文章于 2024-11-12 12:29:51 发布

阅读量200

点赞数

分类专栏： LeetCode 文章标签： Java LeetCode 算法刷题

本文链接：https://blog.csdn.net/iJulyl/article/details/78630904

版权

LeetCode 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Description:

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:

1. How to match?

Use Stack to match.

Every time you input a ( , [ or { , you can push a ) , ] or } into the stack to match later.

Also, we need to check the null at last. // return stack.isEmpty();

Code:

public boolean isValid(String s) {
	Stack<Character> stack = new Stack<Character>();
	for (char c : s.toCharArray()) {
		if (c == '(')
			stack.push(')');
		else if (c == '{')
			stack.push('}');
		else if (c == '[')
			stack.push(']');
		else if (stack.isEmpty() || stack.pop() != c)
			return false;
	}
	return stack.isEmpty();
}

Lesson learned:

1. Stack

2. Check the null.