Package g0901_1000.s0956_tallest_billboard

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    956 - Tallest Billboard\.

    Hard

    You are installing a billboard and want it to have the largest height. The billboard will have two steel supports, one on each side. Each steel support must be an equal height.

    You are given a collection of rods that can be welded together. For example, if you have rods of lengths 1, 2, and 3, you can weld them together to make a support of length 6.

    Return the largest possible height of your billboard installation. If you cannot support the billboard, return 0.

    Example 1:

    Input: rods = 1,2,3,6

    Output: 6

    Explanation: We have two disjoint subsets {1,2,3} and {6}, which have the same sum = 6.

    Example 2:

    Input: rods = 1,2,3,4,5,6

    Output: 10

    Explanation: We have two disjoint subsets {2,3,5} and {4,6}, which have the same sum = 10.

    Example 3:

    Input: rods = 1,2

    Output: 0

    Explanation: The billboard cannot be supported, so we return 0.

    Constraints:

    • 1 <= rods.length <= 20

    • 1 <= rods[i] <= 1000

    • sum(rods[i]) <= 5000

    • 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 tallestBillboard(IntArray rods)

      • Methods inherited from class java.lang.Object

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