just use greedy to solve this problem
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int removeAlmostEqualCharacters(string s) {\n        int count=0;\n        for(int i=1;i<s.size();i++)\n        {\n            int t=abs(int(s[i]-\'a\')-int(s[i-1]-\'a\'));\n            if(s[i]==s[i-1]||(t==1))\n            {\n                count++;\n                i++;\n            }\n        }\n        return count;\n    }\n};\n```
['C++']