20. 有效的括号

题目：

https://leetcode-cn.com/problems/valid-parentheses/

import java.util.Stack;

public class _20_IsValid {
    public boolean isValid(String s) {
        Stack brackets = new Stack<Character>();
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if(brackets.size() == 0) {
                brackets.push(c);
                continue;
            }
            char top = (char) brackets.peek();
            if (match(top, c)) {
                brackets.pop();
            } else {
                brackets.push(c);
            }
        }
        return brackets.size() == 0;
    }

    public boolean match(char a, char b) {
        switch (a) {
            case '(':
                return b == ')';
            case '{':
                return b == '}';
            case '[':
                return b == ']';
            default:
                return false;
        }
    }
}