Simple and easy 3ms c++ solution using map and stack

  • 0
    class Solution {
        bool isValid(string s) {
            stack<char> st;
            map<char,char> mymap;
            mymap['('] = ')';
            mymap['{'] = '}';
            mymap['['] = ']';
            for(int i=0;i<s.length();i++)
                if( mymap.count(s[i])>0) st.push(s[i]);
                else if(st.empty()) return false;
                else if(mymap[]== s[i])  st.pop();
                else return false;
            return st.empty();

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.