Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    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

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final Integer longestString(Integer x, Integer y, Integer z)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait