split-a-string-in-balanced-strings

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Balanced strings are those that have an equal quantity of <code>&#39;L&#39;</code> and <code>&#39;R&#39;</code> characters.

Given a balanced string <code>s</code>, split it into some number of substrings such that:

<ul>
	<li>Each substring is balanced.</li>
</ul>

Return the maximum number of balanced strings you can obtain.

&nbsp;
Example 1:

<pre>
Input: s = &quot;RLRRLLRLRL&quot;
Output: 4
Explanation: s can be split into &quot;RL&quot;, &quot;RRLL&quot;, &quot;RL&quot;, &quot;RL&quot;, each substring contains same number of &#39;L&#39; and &#39;R&#39;.
</pre>

Example 2:

<pre>
Input: s = &quot;RLRRRLLRLL&quot;
Output: 2
Explanation: s can be split into &quot;RL&quot;, &quot;RRRLLRLL&quot;, each substring contains same number of &#39;L&#39; and &#39;R&#39;.
Note that s cannot be split into &quot;RL&quot;, &quot;RR&quot;, &quot;RL&quot;, &quot;LR&quot;, &quot;LL&quot;, because the 2nd and 5th substrings are not balanced.</pre>

Example 3:

<pre>
Input: s = &quot;LLLLRRRR&quot;
Output: 1
Explanation: s can be split into &quot;LLLLRRRR&quot;.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s[i]</code> is either <code>&#39;L&#39;</code> or <code>&#39;R&#39;</code>.</li>
	<li><code>s</code> is a balanced string.</li>
</ul>

balancedStringSplit

Split a String in Balanced Strings

Split Strings by Separator

split-strings-by-separator

按分隔符拆分字符串

Greedy

String

Counting

平衡字符串 中，<code>'L'</code> 和 <code>'R'</code> 字符的数量是相同的。

给你一个平衡字符串&nbsp;<code>s</code>，请你将它分割成尽可能多的子字符串，并满足：

<ul>
	<li>每个子字符串都是平衡字符串。</li>
</ul>

返回可以通过分割得到的平衡字符串的 最大数量 。

&nbsp;

示例 1：

<pre>
输入：s = "RLRRLLRLRL"
输出：4
解释：s 可以分割为 "RL"、"RRLL"、"RL"、"RL" ，每个子字符串中都包含相同数量的 'L' 和 'R' 。
</pre>

示例 2：

<pre>
输入：s = "RLRRRLLRLL"
输出：2
解释：s 可以分割为 "RL"、"RRRLLRLL"，每个子字符串中都包含相同数量的 'L' 和 'R' 。
注意，s 无法分割为 "RL"、"RR"、"RL"、"LR"、"LL" 因为第 2 个和第 5 个子字符串不是平衡字符串。</pre>

示例 3：

<pre>
输入：s = "LLLLRRRR"
输出：1
解释：s 只能保持原样 "LLLLRRRR" 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s[i] = 'L' 或 'R'</code></li>
	<li><code>s</code> 是一个 平衡 字符串</li>
</ul>