You are given n balloons indexed from 0 to n-1. Each balloon has a number on it. If you burst balloon i, you get nums[i-1] * nums[i] * nums[i+1] coins. Burst all balloons to maximize coins.

No results found