算法設計與分析：Burst Balloons（Week 6）

學號：16340008 題目：312. Burst Balloons Question: 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

>>阅读原文<<