[LeetCode] 1081. Smallest Subsequence of Distinct Characters 不同字符的最小子序列

Return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once. Note: This question is the same as
posted @ 2021-03-28 12:07  Grandyang  阅读(650)  评论(0)  编辑  收藏  举报
Fork me on GitHub