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

• 这道题有难度，关于dp的递推关系不太容易想的出来，大概知道需要二维的动态规划dp[i][j],但是dp[i][j]如何递推需要大量的思考加上总结。本题最后根据参考答案。

class Solution {
public:

    int maxCoins(vector<int>nums){
        int n = nums.size();

        if(n <=0 ){
            return 0;
        }

        vector<int> number(n+2,1);
        int dp[n+2][n+2] = {};

        for(int i = 1;i <= n;++i){
            number[i] = nums[i-1];
        }
        n = n+2;
        for(int k = 2;k<n;++k){
            for(int left = 0;left < n-k;++left){
                int right = left+k;
                for(int j = left +1;j<right;++j){
                    dp[left][right] = max(dp[left][right],
                        dp[left][j]+number[left]*number[j]*number[right]+dp[j][right]);
                }
            }
        }

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