Class Solution
java.lang.Object
g1001_1100.s1081_smallest_subsequence_of_distinct_characters.Solution
public class Solution
extends java.lang.Object
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/
-
Constructor Summary
-
Method Summary
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
smallestSubsequence
public java.lang.String smallestSubsequence(java.lang.String s)
-