数据结构C++ 栈 STL

https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/solution/

class Solution {
public:
    string removeDuplicates(string s) {
        stackst;
        for(char a:s){
            if(st.empty()||a!=st.top()){
                st.push(a);
            }
            else{
                st.pop();
            }
        }
        string b="";
        while(!st.empty()){
            b+=st.top();
            st.pop();
        }
        reverse (b.begin(), b.end());
        return b;
    }
};