This content originally appeared on DEV Community and was authored by SalahElhossiny
You are given a string s consisting of lowercase English 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 can be proven that the answer is unique.
Here is the solution:
class Solution(object):
def removeDuplicates(self, s):
"""
:type s: str
:rtype: str
"""
stack = []
for char in s:
if stack and stack[-1] == char:
stack.pop()
else:
stack.append(char)
return "".join(stack)
This content originally appeared on DEV Community and was authored by SalahElhossiny
SalahElhossiny | Sciencx (2022-07-02T19:05:48+00:00) Leetcode Solutions: Remove All Adjacent Duplicates In String. Retrieved from https://www.scien.cx/2022/07/02/leetcode-solutions-remove-all-adjacent-duplicates-in-string/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.