【leetcode】312. Burst Balloons

312. Burst Balloons

https://leetcode.com/problems/burst-balloons/#/description

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

思路

完全没思路，肯定是dp，如果考虑先打破哪一个，好像没有办法去递归求解其他的，看了解析之后，说到第一种方法是backtrack，但是时间复杂度过高，于是有了第二种做法，因为如果判断哪个球nums[i]先打破，这个球的左右nums[i-1]和nums[i+1]会因为nums[i]的打破而变成相邻的元素，因此这个方法并不好。如果考虑哪个球最后打破，看看会不会有不同。最后一个球的左右是确定的。即如果最后打破球k，收益是1*nums[k]*1，这时用两个pointer left，right，这里left和right不一定在k的左右，而是对于整个数组来说的left和right，这时候就可以使用dp了，并且无论选哪两个，都不会对之后的选择有影响。dp[i][j]的意思其实是对于第i~j个球，最大的burst和是多少，所以最后我们给出的结果会是dp[0][n-1]代表nums[0]~nums[n-1]打破的最大和。

代码

public int maxCoins(int[] iNums) {
        int[] nums = new int[iNums.length + 2];
        int n = 1;
        for (int x : iNums) if (x > 0) nums[n++] = x;
        nums[0] = nums[n++] = 1;


        int[][] dp = new int[n][n];
        for (int k = 0; k < n; ++k)
            for (int left = 0; left < n - k; ++left) {
                int right = left + k;
                for (int i = left + 1; i < right; ++i)
                    dp[left][right] = Math.max(dp[left][right],
                            nums[left] * nums[i] * nums[right] + dp[left][i] + dp[i][right]);
            }
        for(int i = 0;i<dp.length;i++){
            for (int j = 0; j < dp[0].length; j++) {
                System.out.print(dp[i][j]+" ");
            }
            System.out.println();
        }
        return dp[0][n - 1];
    }