LeetCode 20. Valid Parentheses有效的括号

一、.问题描述: Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.


二、大致思路
遍历字符串，如果当前字符为左括号，就压入栈中，如果当前字符为右括号，从栈中取出一个字符，看取出来的与当前字符是否匹配

三、代码实现

public class Solution {
    public boolean isValid(String s){

        Stack<Character> stack = new Stack<>();
        for(int i=0;i<s.length();i++){
            char c = s.charAt(i);
            if(c == '(' || c == '[' || c == '{'){
                stack.push(c);
            }else{
                if(stack.isEmpty()){
                    return false;
                }
                char topChar = stack.pop();
                if(c == ')' && topChar != '('){
                    return false;
                }
                if(c == '}' && topChar != '{'){
                    return false;
                }
                if(c == ']' && topChar != '['){
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}