mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
36 lines
1.8 KiB
HTML
36 lines
1.8 KiB
HTML
<p>You are given a string <code>s</code>.</p>
|
|
|
|
<p>A split is called <strong>good</strong> if you can split <code>s</code> into two non-empty strings <code>s<sub>left</sub></code> and <code>s<sub>right</sub></code> where their concatenation is equal to <code>s</code> (i.e., <code>s<sub>left</sub> + s<sub>right</sub> = s</code>) and the number of distinct letters in <code>s<sub>left</sub></code> and <code>s<sub>right</sub></code> is the same.</p>
|
|
|
|
<p>Return <em>the number of <strong>good splits</strong> you can make in <code>s</code></em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "aacaba"
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong> There are 5 ways to split <code>"aacaba"</code> and 2 of them are good.
|
|
("a", "acaba") Left string and right string contains 1 and 3 different letters respectively.
|
|
("aa", "caba") Left string and right string contains 1 and 3 different letters respectively.
|
|
("aac", "aba") Left string and right string contains 2 and 2 different letters respectively (good split).
|
|
("aaca", "ba") Left string and right string contains 2 and 2 different letters respectively (good split).
|
|
("aacab", "a") Left string and right string contains 3 and 1 different letters respectively.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "abcd"
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong> Split the string as follows ("ab", "cd").
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 10<sup>5</sup></code></li>
|
|
<li><code>s</code> consists of only lowercase English letters.</li>
|
|
</ul>
|