leetcode1003-check-if-word-is-valid-after-substitutions_stack.cpp

#include<vector>
#include<algorithm>
#include<iostream>
usingnamespacestd;

classSolution {
public:
boolisValid(string s) {
 string stk; // 用string模拟栈
for (auto& c: s) {
 stk += c;
if (stk.size() >= 3 && stk.substr(stk.size() - 3) == "abc")
 {
for (int i = 0; i < 3; i++)
 stk.pop_back();
 }
 }
return stk.empty();
 }
};

// Test
intmain()
{
 Solution sol;
 string s = "abcabcababcc";
auto res = sol.isValid(s);
 cout << (res ? "True" : "False") << endl;

return0;
}