# 1047. Remove All Adjacent Duplicates In String 删除字符串中的所有相邻重复项

@TOC

## # 题目描述

Given a string `S` of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them.

We repeatedly make duplicate removals on S until we no longer can.

Return the final string after all such duplicate removals have been made. It is guaranteed the answer is unique.

Example 1:

``````Input: "abbaca"
Output: "ca"
Explanation:
For example, in "abbaca" we could remove "bb" since the letters are adjacent and equal, and this is the only possible move.  The result of this move is that the string is "aaca", of which only "aa" is possible, so the final string is "ca".
``````

Note:

1. `1 <= S.length <= 20000`
2. `S` consists only of English lowercase letters.

## # 解题方法

### # 栈

Python代码如下：

``````class Solution(object):
def removeDuplicates(self, S):
"""
:type S: str
:rtype: str
"""
stack = []
for s in S:
if stack and s == stack[-1]:
stack.pop()
continue
stack.append(s)
return "".join(stack)
``````

## # 日期

2019 年 5 月 22 日 —— 一个多月不刷题了，重新捡起来