[LeetCode 312] Burst Ballons (区间DP)

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

---

题解

　　本题要求的是一个涉及到排列顺序的求最大值的题目，没有明显的显式的计算公式，因此可以试着找一找递推的关系式。
　　区间可以由两个端点的下标来表示，因此一个区间[i,j]的如题目所述的求值，可以表示成f(i, j)。现在我们来找一找递推式。
　　假设我们已经求得了所有长度小于等于k的区间的f值，我们如何来确定长度为k+1的区间的f值。我们可以枚举最后一个爆炸的气球的下标，计算爆掉这个气球收获的硬币，已知爆掉剩下的左区间和右区间的硬币数，因此可以求得爆掉这k+1个气球的收获硬币