| English | 简体中文 |
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.
Note: This question is the same as 1081: https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/
Input: s = "bcabc" Output: "abc"
Input: s = "cbacdcbc" Output: "acdb"
1 <= s.length <= 104
sconsists of lowercase English letters.