https://leetcode.com/problems/burst-balloons/
https://leetcode.com/problems/burst-balloons/discuss/76245/Easiest-Java-Solution
解题思路:这道题解题方法很巧,突破点为最终留下的数,他的左边是 start -1 右边是 end+1 , i两边叠加的值分别是
start - 1
,maxCoin(start, i - 1)
,i
,maxCoins(i + 1, end)
,end + 1
- 只需将
maxCoin(start, i - 1) +
i*nums[start-1]*nums[end+1] +maxCoins(i + 1, end) 即可,对于i的选择可以把从start到end都试一遍,选出最大的作为dp[sart][end]的值 ,用dp[][]只是用来剪纸的,不是动态规划。
class Solution {
public int maxCoins(int[] nums) {
int[][] dp = new int[nums.length][nums.length];
return maxCoin(nums,0,nums.length-1,dp);
}
int maxCoin(int[] nums,int start,int end,int[][] dp){
if(start >end)return 0;
if (dp[start][end] != 0)return dp[start][end];
int max = nums[start];
for(int i = start; i <= end; i++){
int val = maxCoin(nums,start,i-1,dp) + get(nums,i)*get(nums,start-1)*get(nums,end+1) +maxCoin(nums,i+1,end,dp);
max = Math.max(max,val);
}
dp[start][end] = max;
return max;
}
int get(int[] nums,int i){
if(i ==-1 || i == nums.length)return 1;
return nums[i];
}
}