[LeetCode] 20. Valid Parentheses - Java

• 문제 링크

Valid Parentheses - LeetCode

 

• 풀이 코드

public class Solution {

    public boolean isValid(String s) {
        char[] stk = new char[s.length() + 1];
        int top = 1;
        for (char c : s.toCharArray()) {
            if (c == '(' || c == '{' || c == '[') stk[top++] = c;
            else if (Math.abs(c - stk[--top]) > 2) return false;
        }

        return top == 1;
    }

}