[LeetCode] 1081. Smallest Subsequence of Distinct Characters

轉自LeetCode

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.

Solution

這題和 316. Remove Duplicate Letters 一模一樣，可以參考那篇

kotlin