Leetcode: Remove All Adjacent Duplicates In String

Remove All Adjacent Duplicates In String



Similar Problems:


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.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


  • Solution:
// Blog link: https://code.dennyzhang.com/remove-all-adjacent-duplicates-in-string
// Basic Ideas: stack
// Complexity: Time O(n), Space O(n)
func removeDuplicates(S string) string {
    stack := []byte{}
    for i:=0; i<len(S); i++ {
        count := len(stack)
        if count == 0 || stack[count-1] != S[i] {
            stack = append(stack, S[i])
        } else {
            stack = stack[0:count-1]
        }
    }
    return string(stack)
}
linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.