【LeetCode-Java实现】20. Valid Parentheses

题目描述

Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Note that an empty string is also considered valid.
Example 1:
Input: “()”
Output: true
Example 2:
Input: “()[]{}”
Output: true
Example 3:
Input: “(]”
Output: false
Example 4:
Input: “([)]”
Output: false
Example 5:
Input: “{[]}”
Output: true

思路

先用HashMap描述括号的匹配关系
若当前元素是左括号就弹进栈
若当前元素是右括号：若此时栈非空，且栈顶元素和当前元素匹配，则将栈顶弹出栈。否则就不匹配
如果最终所有元素都弹出栈了，说明所有元素都匹配上了。即栈空代表匹配成功，栈非空代表匹配不成功

实现

class Solution {
    public boolean isValid(String s) {
        HashMap<Character,Character> pair=new HashMap<>();
        pair.put('}','{');
        pair.put(')','(');
        pair.put(']','[');
        
        Stack<Character> stack=new Stack<>();
        for(int i=0;i<s.length();i++){
            char c=s.charAt(i);
            
            if(pair.containsValue(c)){  //若当前元素c是左括号，就弹进栈
                stack.push(c);
             }
            else{                       //若当前元素c是右括号
                if(stack.isEmpty() || stack.peek()!=pair.get(c)){  //get(key)返回指定key的对应value
                    return false;
                }
                else{   //栈非空且栈顶元素和当前元素c对应的值相等时，弹出栈顶元素
                    stack.pop();
                }
            }
           }
        return stack.isEmpty();
        }
}