20_Valid Parentheses徒手尝试#2(Done)

最新推荐文章于 2019-07-30 21:14:37 发布

TarucaLiu

最新推荐文章于 2019-07-30 21:14:37 发布

阅读量153

点赞数

分类专栏：算法练习文章标签： String Stack

本文链接：https://blog.csdn.net/u014521967/article/details/53366824

版权

算法练习专栏收录该内容

66 篇文章 0 订阅

订阅专栏

My Solution

public boolean isValid(String s) {
        if(s.length() % 2 != 0)
            return false;

        Stack<Character> stack = new Stack<Character>();
        for(int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if(contains(c))
                stack.push(c);
            else {
                if(!stack.isEmpty() && isValidCharacter(stack.peek(), c)) {
                    stack.pop();
                } else {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }

    public boolean contains(char c) {
        return "([{".contains(String.valueOf(c));
    }

    public boolean isValidCharacter(char c1, char c2) {
        return (c1 == '(' && c2 == ')') || (c1 == '[' && c2 == ']') || (c1 == '{' && c2 == '}');
    }