312. Burst Balloons
Given n
balloons, indexed from 0
to n-1
. Each balloon is painted with a number on it represented by array nums
. You are asked to burst all the balloons. If the you burst balloon i
you will get nums[left] * nums[i] * nums[right]
coins. Here left
and right
are adjacent indices of i
. After the burst, the left
and right
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
public class Solution {
public int maxCoins(int[] nums) {
int[] nozero= new int[nums.length+2];
int n=1;
for (int ele: nums) {if (ele>0) nozero[n++]= ele;}
nozero[0]= nozero[n++]= 1;
int[][] dp= new int[n][n];
for (int gap = 2; gap < n; gap++) { // every gap
for (int left = 0; left < n-gap; left++) { // every gap element
int right= left+gap;
for (int i = left+1; i < right; i++) { // every one in the area
dp[left][right]= Math.max(dp[left][right], dp[left][i]+dp[i][right]+nozero[left]*nozero[right]*nozero[i]);
}
}
}
return dp[0][n-1];
}
}