mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
34 lines
1.8 KiB
HTML
34 lines
1.8 KiB
HTML
<p>You are given three integers <code>x</code>, <code>y</code>, and <code>z</code>.</p>
|
|
|
|
<p>You have <code>x</code> strings equal to <code>"AA"</code>, <code>y</code> strings equal to <code>"BB"</code>, and <code>z</code> strings equal to <code>"AB"</code>. You want to choose some (possibly all or none) of these strings and concatenate them in some order to form a new string. This new string must not contain <code>"AAA"</code> or <code>"BBB"</code> as a substring.</p>
|
|
|
|
<p>Return <em>the maximum possible length of the new string</em>.</p>
|
|
|
|
<p>A <b>substring</b> is a contiguous <strong>non-empty</strong> sequence of characters within a string.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> x = 2, y = 5, z = 1
|
|
<strong>Output:</strong> 12
|
|
<strong>Explanation: </strong>We can concactenate the strings "BB", "AA", "BB", "AA", "BB", and "AB" in that order. Then, our new string is "BBAABBAABBAB".
|
|
That string has length 12, and we can show that it is impossible to construct a string of longer length.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> x = 3, y = 2, z = 2
|
|
<strong>Output:</strong> 14
|
|
<strong>Explanation:</strong> We can concactenate the strings "AB", "AB", "AA", "BB", "AA", "BB", and "AA" in that order. Then, our new string is "ABABAABBAABBAA".
|
|
That string has length 14, and we can show that it is impossible to construct a string of longer length.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= x, y, z <= 50</code></li>
|
|
</ul>
|