LeetCode Valid Parentheses

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.

思路一：通过先进后出的栈结构来判断是否配对

代码如下：

class Solution {
public:
    bool isValid(string s) {
        stack<char> Parenth;
        unordered_map<char,int > hash;
        hash['('] = 1; hash[')'] = -1;
        hash['{'] = 2; hash['}'] = -2;
        hash['['] = 3; hash[']'] = -3;
        int len = s.size();
        for(int i=0;i<len;i++)
        {
            if(Parenth.size() == 0 || hash[s[i]] != -hash[Parenth.top()])
            {
                Parenth.push(s[i]);
            }
            else
            {
                Parenth.pop();
            }
        }
        
        if(Parenth.empty())
            return true;
        else
            return false;
    }
};

擦，这。。。 哭晕在厕所，想想怎样提高效率