312. Burst Balloons

最新推荐文章于 2022-07-10 22:15:16 发布

guoyuhaoaaa

最新推荐文章于 2022-07-10 22:15:16 发布

阅读量352

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/guoyuhaoaaa/article/details/54598743

版权

leetcode 专栏收录该内容

8 篇文章 1 订阅

订阅专栏

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

example：
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相乘，比方说上面例子中的数字8。也就是说，这个数字两边的区域的数字并没有混乘（如果混乘的话，中间的数字8就不会留到最后了），故这个最后的数字可以把整个序列划分为两个部分，这就是动态规划结构的构造基础。
dp[i][j]的含义就是从序列 i 位置到序列 j 位置（不包含边界即(i,j)）的最优值。那么递推式就显而易见了：
dp[i][j]=max(dp[i][k]+dp[k][j]+nums[i]*nums[k]*nums[j])k从i+1到j-1

class Solution {
public:
    int maxCoins(vector<int>& nums) {
        nums.insert(nums.begin(),1);
        nums.push_back(1);
        int n=nums.size();
        vector<vector<int>> dp(n,vector<int>(n,0));
        for(int i=2;i<n;i++)
        {
            for(int left=0;left<n-i;left++)
            {
                int right=left+i;
                for(int j=left+1;j<right;j++)
                    dp[left][right]=max(dp[left][right],dp[left][j]+dp[j][right]+nums[left]*nums[right]*nums[j]);
            }
        }
        return dp[0][n-1];
    }
};