题目地址:点击打开链接
题目描述:Given n
balloons, indexed from0
ton-1
. Each balloon is painted with a number on it represented by arraynums
. You are asked to burst all the balloons. If the you burst ballooni
you will getnums[left] * nums[i] * nums[right]
coins. Hereleft
andright
are adjacent indices ofi
. After the burst, theleft
andright
then becomes adjacent.
Find the 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
我的代码:
class Solution {
public:
int maxCoins(vector<int>& nums) {
int l=nums.size();
if(l==0)return 0;
if(l==1)return nums[0];
if(l==2)return nums[0]*nums[1]+max(nums[0],nums[1]);
if(l==3)return nums[0]*nums[1]*nums[2]+nums[0]*nums[2]+max(nums[0],nums[2]);
else{
int min=0;
for(int i=1;i<l;i++){
if(nums[min]>nums[i])min=i;
}
vector<int> v;
for(int i=0;i<min;i++){
v.push_back(nums[i]);
}
for(int i=min+1;i<l;i++){
v.push_back(nums[i]);
}
if(min==0)return nums[min]*nums[min+1]+maxCoins(v);
if(min==l-1)return nums[min]*nums[min-1]+maxCoins(v);
else{
return nums[min]*nums[min+1]*nums[min-1]+maxCoins(v);
}
}
}
};
很遗憾没有accept;原因是我把问题想简单了。
查找了一些accepted 的答案,有所领悟;
以下是正确代码:
class Solution {
public:
int maxCoins(vector<int>& nums) {
int arr[nums.size()+2];
for(int i=1;i<nums.size()+1;++i)arr[i] = nums[i-1];
arr[0] = arr[nums.size()+1] = 1;
int dp[nums.size()+2][nums.size()+2]={};
int n = nums.size()+2;
for(int k=2;k<n;++k)
{
for(int left = 0;left<n-k;++left){
int right = left + k;
for(int i=left+1;i< right; ++i)
{
dp[left][right] = max(dp[left][right],arr[left]*arr[i]*arr[right] + dp[left][i] + dp[i][right]);
}
}
}
return dp[0][n-1];
}
};