You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number on it represented by an array nums. You are asked to burst all the balloons. If you burst the ith balloon, you will get nums[i - 1] * nums[i] * nums[i + 1] coins. If i - 1 or i + 1 goes out of bounds, treat it as if there is a balloon with a 1 painted on it. Return the maximum coins you can collect by bursting the balloons wisely.
Java
Burst Balloons
You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number on it represented by an array nums. You are asked to burst all the balloons. If you burst the ith balloon, you will get nums[i - 1] * nums[i] * nums[i + 1] coins. If i - 1 or i + 1 goes out of bounds, treat it as if there is a balloon with a 1 painted on it. Return the maximum coins you can collect by bursting the balloons wisely.
Example 1:
Input: {"nums":[3,1,5,8]}
Output: 167
Input
arr ={"nums":[3,1,5,8]}
Pad array with 1s: [1, 3, 1, 5, 8, 1]. Initialize DP table.
Balloons (with 1s padding)
10
31
12
53
84
15
DP Table: dp[i][j] = max coins from bursting balloons in range (i, j)