没看答案,python的栈就是列表。
class Solution:
def removeDuplicates(self, s: str) -> str:
stack = []
i, n = 0, len(s)
while i < n:
if not stack:
stack.append(s[i])
elif s[i] == stack[-1]:
stack.pop()
else:
stack.append(s[i])
i += 1
return ''.join(stack)