smallest-subsequence-of-distinct-characters

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>s</code>, return the lexicographically smallest subsequence of <code>s</code> that contains all the distinct characters of <code>s</code> exactly once.

&nbsp;
Example 1:

<pre>
Input: s = &quot;bcabc&quot;
Output: &quot;abc&quot;
</pre>

Example 2:

<pre>
Input: s = &quot;cbacdcbc&quot;
Output: &quot;acdb&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

&nbsp;
Note: This question is the same as 316: <a href="https://leetcode.com/problems/remove-duplicate-letters/" target="_blank">https://leetcode.com/problems/remove-duplicate-letters/</a>

smallestSubsequence

Smallest Subsequence of Distinct Characters

Find the Most Competitive Subsequence

find-the-most-competitive-subsequence

找出最具竞争力的子序列

Stack

Greedy

String

Monotonic Stack

返回 <code>s</code> 字典序最小的子序列，该子序列包含 <code>s</code> 的所有不同字符，且只包含一次。

&nbsp;

示例 1：

<pre>
输入：<code>s = "bcabc"</code>
输出<code>：</code><code>"abc"</code>
</pre>

示例 2：

<pre>
输入：<code>s = "cbacdcbc"</code>
输出：<code>"acdb"</code></pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> 由小写英文字母组成</li>
</ul>

&nbsp;

注意：该题与 316 <a href="https://leetcode.cn/problems/remove-duplicate-letters/">https://leetcode.cn/problems/remove-duplicate-letters/</a> 相同