956. Tallest Billboard

⭐️⭐️⭐️⭐️⭐️

# 題目敘述

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.

# 解題思路

# Solution

import java.util.Arrays;

public class Solution {

    public int tallestBillboard(int[] rods) {

        int maxSize = 0;

        for(int rod : rods){

            maxSize += rod;

        }

        int[] dp = new int[maxSize + 1];

        Arrays.fill(dp, -1);

        dp[0] = 0;

        for(int rod : rods){

            int[] dpCopy = dp.clone();

            for (int i = 0; i <= maxSize - rod; i++) {

                if (dpCopy[i] < 0) continue;

                dp[i + rod] = Math.max(dp[i + rod], dpCopy[i]);

                dp[Math.abs(i - rod)] = Math.max(dp[Math.abs(i - rod)], dpCopy[i] + Math.min(i, rod));

            }

        }

        return dp[0];

    }

}