mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
40 lines
1.4 KiB
HTML
40 lines
1.4 KiB
HTML
<p><strong>Balanced</strong> strings are those that have an equal quantity of <code>'L'</code> and <code>'R'</code> characters.</p>
|
|
|
|
<p>Given a <strong>balanced</strong> string <code>s</code>, split it in the maximum amount of balanced strings.</p>
|
|
|
|
<p>Return <em>the maximum amount of split <strong>balanced</strong> strings</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "RLRRLLRLRL"
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong> s can be split into "RL", "RRLL", "RL", "RL", each substring contains same number of 'L' and 'R'.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "RLLLLRRRLR"
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> s can be split into "RL", "LLLRRR", "LR", each substring contains same number of 'L' and 'R'.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "LLLLRRRR"
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong> s can be split into "LLLLRRRR".
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 1000</code></li>
|
|
<li><code>s[i]</code> is either <code>'L'</code> or <code>'R'</code>.</li>
|
|
<li><code>s</code> is a <strong>balanced</strong> string.</li>
|
|
</ul>
|