Package g1001_1100.s1081_smallest_subsequence_of_distinct_characters

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1081 - Smallest Subsequence of Distinct Characters.

    Medium

    Given a string s, return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once.

    Example 1:

    Input: s = "bcabc"

    Output: "abc"

    Example 2:

    Input: s = "cbacdcbc"

    Output: "acdb"

    Constraints:

    • 1 <= s.length <= 1000

    • s consists of lowercase English letters.

    Note: This question is the same as 316: https://leetcode.com/problems/remove-duplicate-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 smallestSubsequence(String s)

      • Methods inherited from class java.lang.Object

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