0%

### leetcode 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

Java 18ms

C++ 76ms

Python 1100ms

# DP

C++跑1330MS  ，JAVA 187MS ，python TLE 。。。。python TLE 可以理解，但C++比JAVA这题还慢这不合理。。。。可能是vector太慢？

• update at 2015.12.22 :重新提交发现跑快了,目测为了照顾python 把数据量降下来了

Java 15ms

C++ 36ms