leetcode312

 class Solution {
     public int maxCoins(int[] iNums) {
     int[] nums = new int[iNums.length + 2];
     int n = 1;
     for (int x : iNums) if (x > 0) nums[n++] = x;
     nums[0] = nums[n++] = 1;

     int[][] dp = new int[n][n];
     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] = Math.max(dp[left][right],
                 nums[left] * nums[i] * nums[right] + dp[left][i] + dp[i][right]);
         }

     return dp[0][n - 1];
     }
 }

参考：https://leetcode.com/problems/burst-balloons/discuss/76228/Share-some-analysis-and-explanations

补充一个python的实现：

 class Solution:
     def maxCoins(self, nums: 'List[int]') -> 'int':
         nums = [1] + nums + [1]
         n = len(nums)
         dp = [[0 for _ in range(n)]for _ in range(n)]
         for k in range(2,n):
             for left in range(n-k):
                 right = left + k
                 for i in range(left+1,right):
                     dp[left][right] = max(dp[left][right],nums[left] * nums[i] * nums[right] + dp[left][i] + dp[i][right])
         return dp[0][n-1]