Package g0301_0400.s0312_burst_balloons

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    312 - Burst Balloons.

    Hard

    You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number on it represented by an array nums. You are asked to burst all the balloons.

    If you burst the <code>i<sup>th</sup></code> balloon, you will get nums[i - 1] * nums[i] * nums[i + 1] coins. If i - 1 or i + 1 goes out of bounds of the array, then treat it as if there is a balloon with a 1 painted on it.

    Return the maximum coins you can collect by bursting the balloons wisely.

    Example 1:

    Input: nums = 3,1,5,8

    Output: 167

    Explanation: 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

    Example 2:

    Input: nums = 1,5

    Output: 10

    Constraints:

    • n == nums.length

    • 1 &lt;= n &lt;= 300

    • 0 &lt;= nums[i] &lt;= 100

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxCoins(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait