leetcode(力扣)第二十题：有效的括号_C++

class Solution {
public:
    bool isValid(string s) {
        string stack="";
        stack+=s[0];
        int ptr1=0,ptr2=1;
        while(ptr2<s.length()){
            if(ptr1==-1) {
                stack+=s[ptr2];
                ++ptr1;
            }
            else if((stack[ptr1]=='('&&s[ptr2]==')')||
                    (stack[ptr1]=='['&&s[ptr2]==']')||
                    (stack[ptr1]=='{'&&s[ptr2]=='}')) 
                stack.erase(ptr1--,1);
            else {
                ++ptr1;
                stack+=s[ptr2];
            }
            ++ptr2;
        }
        return ptr1==-1?true:false;
    }
};

push pop push pop push pop push pop