解題系統

內容：

Balanced strings are those that have an equal quantity of 'L' and 'R' characters.

Given a balanced string s, split it in the maximum amount of balanced strings.

Return the maximum amount of split balanced strings.

------------------------------------------

Constraints:

輸入說明

輸出說明

範例輸入

RLRRLLRLRL

範例輸出

測資資訊：

記憶體限制： 64 MB
公開測資點#0 (100%): 1.0s , <1K

提示：

Explanation for example:

s can be split into "RL", "RRLL", "RL", "RL", each substring contains same number of 'L' and 'R'.

Hint:

Loop from left to right maintaining a balance variable when it gets an L increase it by one otherwise decrease it by one.
Whenever the balance variable reaches zero then we increase the answer by one.

標籤:

出處:

leetcode [編輯： will8467 (will8467) ]

編號	身分	題目	主題	人氣	發表日期
沒有發現任何「解題報告」