mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-27 10:40:26 +08:00
41 lines
1.8 KiB
HTML
41 lines
1.8 KiB
HTML
|
<p>给你一个字符串 <code>s</code> ，你需要将它分割成一个或者更多的 <strong>平衡</strong> 子字符串。比方说，<code>s == "ababcc"</code> 那么 <code>("abab", "c", "c")</code> ，<code>("ab", "abc", "c")</code> 和 <code>("ababcc")</code> 都是合法分割，但是 <code>("a", <strong>"bab"</strong>, "cc")</code> ，<code>(<strong>"aba"</strong>, "bc", "c")</code> 和 <code>("ab", <strong>"abcc"</strong>)</code> 不是，不平衡的子字符串用粗体表示。</p>
|
|||
|
|
|
|||
|
|
<p>请你返回 <code>s</code> <strong>最少</strong> 能分割成多少个平衡子字符串。</p>
|
|||
|
|
|
|||
|
|
<p><b>注意：</b>一个 <strong>平衡</strong> 字符串指的是字符串中所有字符出现的次数都相同。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong class="example">示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<div class="example-block">
|
|||
|
|
<p><span class="example-io"><b>输入：</b>s = "fabccddg"</span></p>
|
|||
|
|
|
|||
|
|
<p><span class="example-io"><b>输出：</b>3</span></p>
|
|||
|
|
|
|||
|
|
<p><strong>解释：</strong></p>
|
|||
|
|
|
|||
|
|
<p>我们可以将 <code>s</code> 分割成 3 个子字符串：<code>("fab, "ccdd", "g")</code> 或者 <code>("fabc", "cd", "dg")</code> 。</p>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p><strong class="example">示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<div class="example-block">
|
|||
|
|
<p><span class="example-io"><b>输入：</b>s = "abababaccddb"</span></p>
|
|||
|
|
|
|||
|
|
<p><span class="example-io"><b>输出：</b>2</span></p>
|
|||
|
|
|
|||
|
|
<p><strong>解释：</strong></p>
|
|||
|
|
|
|||
|
|
<p>我们可以将 <code>s</code> 分割成 2 个子字符串：<code>("abab", "abaccddb")</code> 。</p>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= s.length <= 1000</code></li>
|
|||
|
|
<li><code>s</code> 只包含小写英文字母。</li>
|
|||
|
|
</ul>
|