Given n balloons, indexed from 0 to n-1. Eachballoon is painted with a number on it represented by array nums. You are asked to burst all theballoons. If the you burst balloon i you will get nums[left] * nums[i] * nums[right] coins. Here left and right areadjacent indices of i. After theburst, the left and right then becomes adjacent.
Findthe maximum coins you can collect by bursting the balloons wisely.
Note:
(1) You may imagine nums[-1] = nums[n] = 1. They are not real therefore you can not burst them.
(2) 0 ≤ n ≤ 500, 0 ≤ nums[i] ≤ 100
Example:
Given [3, 1, 5, 8]
Return 167
nums = [3,1,5,8]--> [3,5,8] --> [3,8] --> [8] --> []
coins = 3*1*5 + 3*5*8 + 1*3*8 + 1*8*1 = 167
Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.
这是一题典型的二分dp题目,以后在做题的时候一定要记住,二分dp也可以称为树状dp,特点是假设最后一步取值i,那么0~I,和i+1~n也具有最优子结构,确实很抽象,不过想几遍就能明白,
这一题还可以进一步优化,当取for循环里面最大的一个tmp,然后将这个值赋给指定数组位置num[i]的时候,可以优化成num[i]=max(num[i],tmp),这样可以减少题目的步骤!
class Solution {
public:
intmaxCoins(vector<int>& nums) {
int n = nums.size(); intend,tmp1,tmp2,score,tmp;
vector<vector<int>> dp(n+2,vector<int>(n+2, 0));
for(int l=1;l<=n;l++)
for (int i = 0; i <= n - l; i++)
{
score = -1;
end = i + l - 1;
for (int h = i; h <= end;h++)
{
tmp1 = i - 1 >= 0 ?nums[i - 1] : 1;
tmp2= end + 1 >= n ? 1: nums[end+1];
tmp = tmp1*tmp2*nums[h] +dp[i+1][h] + dp[h + 2][end+1];
score = max(score, tmp);
}
dp[i + 1][end + 1] = score;
}
return dp[1][n];
}
};