Skip to content

Latest commit

 

History

History
48 lines (27 loc) · 1.03 KB

File metadata and controls

48 lines (27 loc) · 1.03 KB

中文文档

Description

Given a string which contains only lowercase letters, 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.

Example 1:

Input: "bcabc"
Output: "abc"

Example 2:

Input: "cbacdcbc"
Output: "acdb"

Note: This question is the same as 1081: https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/

Solutions

Python3

Java

...