Hard-题目3: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
题目大意:
给出n个气球,每个气球上有一个数字,进行以下的游戏:玩家每次刺破一个气球,获得m元钱,其中m为刺破的气球及其相邻两个气球上面的数字的乘积(规定第-1个和第n个气球上的数字为1,相当于边缘的气球只考虑一边即可),计算玩家可能获得的最大收益。
题目分析:
设dp[i][j]表示从第i个气球到第j个气球的最大收益,则有如下转移方程:

dp[i][j]=min⁡(dp[i][k-1]+num[k-1]*num[k]*num[k+1]+dp[k+1][j]),k∈(i,j)

很好理解,从第i个气球到第j的气球的最大收益要暴力枚举从其中的第k位刺破所带来的收益。最终问题即求dp[1][n].
源码:(language:cpp)

class Solution {
public:
    int maxCoins(vector<int>& nums) {
        for(int i=0;i<nums.size();++i){
            if(nums[i]==0){
                nums.erase(nums.begin()+i);
                --i;
            }
        }
        int n=nums.size();
        if(n==0) return 0;
        nums.insert(nums.begin(),1);
        nums.insert(nums.end(),1);
        int m=nums.size();
        vector<vector<int>> dp(m,vector<int>(m,0));
        for(int count=1;count<=n;++count){
            for(int start=1;start+count-1<=n;++start){
                int bestcoins=0;
                for(int b=0;b<count;++b){
                    bestcoins=max(bestcoins,dp[start][start+b-1]+nums[start-1]*nums[start+b]*nums[start+count]+dp[start+b+1][start+count-1]);

                }
                dp[start][start+count-1]=bestcoins;
            }

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

成绩:
36ms,beats 61.75%,众数44ms,22.51%
Cmershen的碎碎念:
本题的转移方程及其实现都不难,难在想到这个递推关系。而通常会想到回溯法,显然要暴力枚举每种扎气球的方法,其复杂度为O(n!),在n=500的数据量下是不能接受的。考虑到每扎破一个气球,都退化成求两边的最佳扎破方法,故可以使用dp,本算法复杂度O(n3).

阅读更多
版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs https://blog.csdn.net/cmershen/article/details/51550157
个人分类: Leetcode
上一篇Hard-题目2:287. Find the Duplicate Number
下一篇Hard-题目4:145. Binary Tree Postorder Traversal
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭