Package g1001_1100.s1047_remove_all_adjacent_duplicates_in_string

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1047 - Remove All Adjacent Duplicates In String\.

    Easy

    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.

    Example 1:

    Input: s = "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".

    Example 2:

    Input: s = "azxxzy"

    Output: "ay"

    Constraints:

    • <code>1 <= s.length <= 10<sup>5</sup></code>

    • s consists of lowercase English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String removeDuplicates(String s)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait