LeetCode DAY35(343. Integer Break&96. Unique Binary Search Trees)

最新推荐文章于 2024-10-01 05:04:32 发布

Emerson's tree house

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量36

点赞数

文章标签： leetcode 算法动态规划

本文链接：https://blog.csdn.net/weixin_48078699/article/details/129209143

版权

文章介绍了使用动态规划方法解决LeetCode上的两个问题：IntegerBreak（寻找整数拆分的最大乘积）和UniqueBinarySearchTrees（计算结构独特的二叉搜索树的数量）。分别给出了C++的代码实现，讨论了如何通过循环和动态更新状态数组来找到最优解。

摘要由CSDN通过智能技术生成

Journey of LeetCode|DAY 35

Preface
1. Integer Break
- Analysis and Solution
- - Dynamic programming
2. Unique Binary Search Trees
- Analysis and Solution
- - Dynamic programming

Preface

This is a new day to continue my Dynamic programming journey.
Learn something new and keep reviewing what I learnt before.

1. Integer Break

LeetCode Link: 343. Integer Break
Given an integer n, break it into the sum of k positive integers, where k >= 2, and maximize the product of those integers.

Return the maximum product you can get.

Example 1:

Input: n = 2
Output: 1
Explanation: 2 = 1 + 1, 1 × 1 = 1.
Example 2:

Input: n = 10
Output: 36
Explanation: 10 = 3 + 3 + 4, 3 × 3 × 4 = 36.

Constraints:

2 <= n <= 58

Analysis and Solution

Dynamic programming

LeetCode C++ as followings Dynamic programming

class Solution {
public:
    int integerBreak(int n) {
        vector<int> dp(n + 1);
        dp[2] = 1;
        for (int i = 3; i <= n ; i++) {
            for (int j = 1; j <= i / 2; j++) {
                dp[i] = max(dp[i], max((i - j) * j, dp[i - j] * j));
            }
        }
        return dp[n];
    }
};

2. Unique Binary Search Trees

LeetCode Link: 96. Unique Binary Search Trees
Given an integer n, return the number of structurally unique BST’s (binary search trees) which has exactly n nodes of unique values from 1 to n.

Example 1:
在这里插入图片描述

Input: n = 3
Output: 5
Example 2:

Input: n = 1
Output: 1

Constraints:

1 <= n <= 19

Analysis and Solution

Dynamic programming

LeetCode C++ as followings Dynamic programming

class Solution {
public:
    int numTrees(int n) {
        vector<int> dp(n + 1);
        dp[0] = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                dp[i] += dp[j - 1] * dp[i - j];
            }
        }
        return dp[n];
    }
};