1049. Last Stone Weight II

We have a collection of rocks, each rock has a positive integer weight.

Each turn, we choose any two rocks and smash them together.  Suppose the stones have weights x and y with x <= y.  The result of this smash is:

• If x == y, both stones are totally destroyed;
• If x != y, the stone of weight x is totally destroyed, and the stone of weight y has new weight y-x.

At the end, there is at most 1 stone left.  Return the smallest possible weight of this stone (the weight is 0 if there are no stones left.)

 

Example 1:

Input: [2,7,4,1,8,1]
Output: 1
Explanation: 
We can combine 2 and 4 to get 2 so the array converts to [2,7,1,8,1] then,
we can combine 7 and 8 to get 1 so the array converts to [2,1,1,1] then,
we can combine 2 and 1 to get 1 so the array converts to [1,1,1] then,
we can combine 1 and 1 to get 0 so the array converts to [1] then that's the optimal value.

 

Note:

1. 1 <= stones.length <= 30
2. 1 <= stones[i] <= 100

思路：可以等价为为每个数添加正负号，然后求和，然后求 “和最小的情况”

这不就是背包问题的变形吗

class Solution(object):
    def lastStoneWeightII(self, stones):
        """
        :type stones: List[int]
        :rtype: int
        """
        su=sum(stones)
        target=su//2
        n=len(stones)
        dp=[[0 for _ in range(target+1)] for _ in range(n)]
        for j in range(stones[0], target+1): dp[0][j]=stones[0]
        for i in range(1,len(stones)):
            for j in range(target+1):
                if j<stones[i]: dp[i][j]=dp[i-1][j]
                else: dp[i][j]=max(dp[i-1][j], dp[i-1][j-stones[i]]+stones[i])
        return su-2*dp[-1][target]