使用栈
#include <stack>
class Solution {
public:
string removeStars(string s) {
stack<char> stack;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '*') {
stack.pop();
} else {
stack.push(s[i]);
}
}
vector<char> tmp_vec(stack.size(), '0');
for (int j = tmp_vec.size()-1; j >= 0; j--) {
tmp_vec[j] = stack.top();
stack.pop();
}
string res(tmp_vec.begin(), tmp_vec.end());
return res;
}
};