20. Valid Parentheses （括号匹配）

最新推荐文章于 2020-10-28 18:29:44 发布

Alan_Xiang

最新推荐文章于 2020-10-28 18:29:44 发布

阅读量438

点赞数

分类专栏： leetcode LeetCode Solutions In Java 文章标签： leetcode 算法 stack

本文链接：https://blog.csdn.net/xiangwanpeng/article/details/52947873

版权

leetcode 同时被 2 个专栏收录

122 篇文章 0 订阅

订阅专栏

LeetCode Solutions In Java

122 篇文章 7 订阅

订阅专栏

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.

public class Solution {
    class Stack<T> {
	LinkedList<T> list = new LinkedList<T>();

	public void push(T t) {
		list.addFirst(t);
	}

	public T peek() {
	    if(!list.isEmpty())
		return list.getFirst();
		return null;
	}

	public T pop() {
	    if(!list.isEmpty())
		return list.removeFirst();
	    return null;
	}

	public boolean isEmpty() {
		return list.isEmpty();
	}
}
    public boolean isValid(String s) {
        Stack<Character> stack = new Stack<Character>();
		for (char ch : s.toCharArray()) {
			switch (ch) {
			case '{':
				stack.push(ch);
				break;
			case '(':
				stack.push(ch);
				break;
			case '[':
				stack.push(ch);
				break;
			case '}':
				if (stack.peek()!=null&&stack.peek() == '{') {
					stack.pop();
					break;
				} else
					return false;
			case ')':
				if (stack.peek()!=null&&stack.peek() == '(') {
					stack.pop();
					break;
				} else
					return false;
			case ']':
				if (stack.peek()!=null&&stack.peek() == '[') {
					stack.pop();
					break;
				} else
					return false;
			default:
				break;
			}

		}if(!stack.isEmpty())
			return false;
		return true;
    }
}