leetcode

0 class Solution {

1 public:

2 string makeGood(string s) {

3 int i = 0;

4 while (i < s.size())

5 if (s[i] != s[i + 1] && toupper(s[i]) == toupper(s[i + 1])) {

6 s.erase(i, 2);

7 i = max(0, i - 1);

8 } else {

9 i++;

10 }

11 return s;

12 }

13 };