• Home
• com.github.javadev
• leetcode-in-java21
• 1.35
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2701_2800.s2745_construct_the_longest_new_string.readme.md Maven / Gradle / Ivy

2745\. Construct the Longest New String

Medium

You are given three integers `x`, `y`, and `z`.

You have `x` strings equal to `"AA"`, `y` strings equal to `"BB"`, and `z` strings equal to `"AB"`. You want to choose some (possibly all or none) of these strings and concactenate them in some order to form a new string. This new string must not contain `"AAA"` or `"BBB"` as a substring.

Return _the maximum possible length of the new string_.

A **substring** is a contiguous **non-empty** sequence of characters within a string.

**Example 1:**

**Input:** x = 2, y = 5, z = 1

**Output:** 12

**Explanation:** 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.

**Example 2:**

**Input:** x = 3, y = 2, z = 2

**Output:** 14

**Explanation:** 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.

**Constraints:**

*   `1 <= x, y, z <= 50`