Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    316 - Remove Duplicate Letters.

    Medium

    Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order among all possible results.

    Example 1:

    Input: s = "bcabc"

    Output: "abc"

    Example 2:

    Input: s = "cbacdcbc"

    Output: "acdb"

    Constraints:

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

    • s consists of lowercase English letters.

    Note: This question is the same as 1081: https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/

    • 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 removeDuplicateLetters(String s)
      • Methods inherited from class java.lang.Object

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