LeetCode //C - 312. Burst Balloons

312. Burst Balloons

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 i t h i^{th} ith 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 = 31 5 + 35 8 + 13 8 + 181 = 167

Example 2:

Input: nums = [1,5]
Output: 10

Constraints:
  • n == nums.length
  • 1 <= n <= 300
  • 0 <= nums[i] <= 100

From: LeetCode

Link: 312. Burst Balloons


Solution:

Ideas:
  • newNums: We create a new array newNums with additional 1s at the boundaries, which simplifies edge cases where we deal with the first or last balloon.

  • Dynamic Programming (dp): We use a 2D array dp where dp[left][right] represents the maximum coins that can be collected from bursting all the balloons between left and right (exclusive).

  • Window Size Iteration: We iterate over all possible lengths (len) of subarrays and calculate the maximum coins that can be obtained by bursting balloons in that subarray.

  • Time Complexity: The algorithm runs in O(n^3) time due to the triple nested loop, which is efficient enough given the constraints.

Code:
c 复制代码
int maxCoins(int* nums, int numsSize) {
    // Create a new array with 1s at the boundaries
    int* newNums = (int*)malloc((numsSize + 2) * sizeof(int));
    newNums[0] = 1;
    newNums[numsSize + 1] = 1;
    for (int i = 1; i <= numsSize; i++) {
        newNums[i] = nums[i - 1];
    }
    
    int n = numsSize + 2;
    int** dp = (int**)malloc(n * sizeof(int*));
    for (int i = 0; i < n; i++) {
        dp[i] = (int*)calloc(n, sizeof(int));
    }
    
    for (int len = 2; len < n; len++) { // len is the window size
        for (int left = 0; left < n - len; left++) {
            int right = left + len;
            for (int i = left + 1; i < right; i++) {
                dp[left][right] = fmax(dp[left][right], newNums[left] * newNums[i] * newNums[right] + dp[left][i] + dp[i][right]);
            }
        }
    }
    
    int result = dp[0][n - 1];
    
    for (int i = 0; i < n; i++) {
        free(dp[i]);
    }
    free(dp);
    free(newNums);
    
    return result;
}
相关推荐
DoraBigHead36 分钟前
小哆啦解题记——异位词界的社交网络
算法
木头左2 小时前
逻辑回归的Python实现与优化
python·算法·逻辑回归
lifallen6 小时前
Paimon LSM Tree Compaction 策略
java·大数据·数据结构·数据库·算法·lsm-tree
啟明起鸣6 小时前
【网络编程】简易的 p2p 模型,实现两台虚拟机之间的简单点对点通信,并以小见大观察 TCP 协议的具体运行
c语言·网络·tcp/ip·p2p
web_Hsir8 小时前
vue3.2 前端动态分页算法
前端·算法
地平线开发者10 小时前
征程 6M 部署 Omnidet 感知模型
算法·自动驾驶
秋说11 小时前
【PTA数据结构 | C语言版】线性表循环右移
c语言·数据结构·算法
浩瀚星辰202411 小时前
图论基础算法:DFS、BFS、并查集与拓扑排序的Java实现
java·算法·深度优先·图论
芯岭技术12 小时前
MS32C001-C单片机,32位ARM M0+内核,宽电压、低功耗、小封装。
c语言·arm开发·单片机
JiaJZhong13 小时前
力扣.最长回文子串(c++)
java·c++·leetcode