LeetCode：Valid Parentheses

最新推荐文章于 2018-11-29 17:11:58 发布

夜读春秋

最新推荐文章于 2018-11-29 17:11:58 发布

阅读量430

点赞数

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

本文链接：https://blog.csdn.net/alading2009/article/details/51168036

版权

LeetCode 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

题目链接：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.

显然是一个出栈入栈匹配的问题，并且不是完整的四则运算式子，仅有大中小三种括号，不难。

代码如下：

public class Solution {
    public boolean isValid(String s) {
        int length = s.length();
        Stack<Character> stack = new Stack<>();
        for (int i=0; i<length; i++) {
            char c = s.charAt(i);
            if (c == '(' || c == '[' || c == '{') {
                stack.push(c);
            } else if (stack.isEmpty()){
                return false;
            } else {
                char top = stack.peek();
                if ((c == ')' && top == '(')
                        || (c == ']' && top == '[')
                        || (c == '}' && top == '{')) {
                    stack.pop();
                } else {
                    return false;
                }
            }
        }
        return stack.isEmpty();
    }
}