LeetCode 20. 有效的括号

class Solution {
public:
    bool isValid(string s) {
        stack<int> stk;
        for(int i = 0; i < s.size(); i ++){
            if(s[i] == '(' || s[i] == '[' || s[i] == '{') stk.push(s[i]);
            else{
                if(stk.size() && abs(s[i] - stk.top()) <= 2) stk.pop();
                else return false;
            }
        }    

        return stk.empty();
    }
};