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:

• You may imagine nums[-1] = nums[n] = 1. They are not real therefore you can not burst them.
• 0 ≤ n ≤ 500, 0 ≤ nums[i] ≤ 100

Example:

Input: [3,1,5,8]

Output: 167 Explanation: 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

思路：

【状态转移方程】由于最后一步是1 * nums[i] * 1，我们可以认为两端有两个不能扎破的气球，值为1，dp[i][j]代表扎破i号气球～j号气球能获得的金币数，，并且当前气球k不能被扎破，要分别考虑k的左侧（i～k-1）和右侧（k+1～j），状态转移方程为：

• dp[i][j] = max{dp[i][j] , dp[i][k-1] + dp[k+1][j] + a[i-1] * a[k] * a[j+1]},k∈(i,j)

dp[i][k-1]代表扎破i～k-1号气球，dp[k+1][j]代表扎破k+1～j号气球，再加上扎破这个气球获得的金币数

class Solution {
public:
    int maxCoins(vector<int>& nums) {
        int n = nums.size();

        //区间两侧填充1
        nums.push_back(1);
        nums.insert(nums.begin(),1);
        vector< vector<int>> dp(n+2, vector<int>(n+2,0));
        //len:区间大小
        for(int len =1; len <= n; len++){
            for(int i=1; i<= n-len+1; i++){
                int j = i + len-1;
                for(int k = i; k <= j; k++){
                    //i~j之间最佳选择
                    dp[i][j] = max(dp[i][j], dp[i][k-1]+dp[k+1][j] + nums[i-1]*nums[k]*nums[j+1]);
                }
            }
        }
        return dp[1][n];  
    }
};