LeetCode 1047 Remove all adjacent duplicates in a string

1047.Remove all adjacent duplicates in a string

Simple Difficulty 410 Favorites and Sharing Switch to English to receive dynamic feedback

Given the string S consisting of lowercase letters, the duplicate removal selects two adjacent and identical letters and deletes them.

Repeat deduplication on S until no further deletions are possible.

Returns the final string after all deduplication operations are done.The answer is guaranteed to be unique.

Example:

Enter:"abbaca"Output:"ca"Explanation:For example, in "abbaca", we can delete "bb" since the two letters are adjacent and identical, this is the only duplicate that can be deleted at this time.Then we get the string "aaca", of which only "aa" can perform the deduplication operation, so the final string is "ca".

Tip:

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

class Solution:def removeDuplicates(self, s: str) -> str:# Use the stack, compare the ones that are not on the stack with the top of the stack, if they are the same, they will pop, and if they are not, they will be pushed into the stack.lst = []for v in s:if lst and lst[-1] == v:lst.pop()else:lst.append(v)return "".join(lst)