Last Stone Weight II
You are given an array of integers stones where stones[i] is the weight of the i^th stone.
We are playing a game with the stones. On each turn, we choose any two stones 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 destroyed. - If
x != y, the stone of weightxis destroyed, and the stone of weightyhas new weighty - x.
At the end of the game, there is at most one stone left.
Return the smallest possible weight of the left stone. If there are no stones left, return 0.
Example 1
Input
stones = [2,7,4,1,8,1]Output
1This sequence of smashes leaves a single stone of weight 1, which is the optimal value.
Example 2
Input
stones = [31,26,33,21,40]Output
5The smallest possible weight of the left stone is 5.
Constraints
- 1 <= stones.length <= 30
- 1 <= stones[i] <= 100