[Algorithm] Leetcode Valid Parentheses

in Study on 자료구조&알고리즘

Leetcode Valid Parentheses

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

Solution

class Solution {
    public boolean isValid(String s) {
        Stack<Character> stack = new Stack<>();
        for (char c : s.toCharArray()) {
            if (c == '(') {
                stack.add(')');
            } else if (c == '[') {
                stack.add(']');
            } else if (c == '{') {
                stack.add('}');
            } else if (stack.isEmpty() || stack.pop() != c) {
                return false;
            }
        }
        
        return stack.isEmpty();
    }
}