28 lines
939 B
Markdown
28 lines
939 B
Markdown
|
<p>返回 <code>s</code> 字典序最小的子序列，该子序列包含 <code>s</code> 的所有不同字符，且只包含一次。</p>
|
|||
|
|
|
|||
|
|
<p><strong>注意：</strong>该题与 316 <a href="https://leetcode.com/problems/remove-duplicate-letters/">https://leetcode.com/problems/remove-duplicate-letters/</a> 相同</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong><code>s = "bcabc"</code>
|
|||
|
|
<strong>输出<code>：</code></strong><code>"abc"</code>
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong><code>s = "cbacdcbc"</code>
|
|||
|
|
<strong>输出：</strong><code>"acdb"</code></pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= s.length <= 1000</code></li>
|
|||
|
|
<li><code>s</code> 由小写英文字母组成</li>
|
|||
|
|
</ul>
|
|||
|
|
<div><div>Related Topics</div><div><li>栈</li><li>贪心算法</li><li>字符串</li></div></div>\n<div><li>👍 95</li><li>👎 0</li></div>
|