feat: add solutions to lc problem: No.0377

No.0377.Combination Sum IV

Author: yanglbme

README.md

@@ -81,6 +81,7 @@
 -   [分割等和子集](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README.md) - 0-1 背包问题
 -   [最后一块石头的重量 II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md) - 0-1 背包问题
 -   [零钱兑换](/solution/0300-0399/0322.Coin%20Change/README.md) - 完全背包问题
+-   [组合总和 Ⅳ](/solution/0300-0399/0377.Combination%20Sum%20IV/README.md) - 完全背包问题
 <!-- 背包问题、状态机模型、状压DP、区间DP、树形DP、数位DP 待补充 -->
 
 ### 4. 高级数据结构

README_EN.md

@@ -77,7 +77,8 @@ Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](h
 -   [Target Sum](/solution/0400-0499/0494.Target%20Sum/README_EN.md) - 0-1 Knapsack problem
 -   [Partition Equal Subset Sum](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README_EN.md) - 0-1 Knapsack problem
 -   [Last Stone Weight II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README_EN.md) - 0-1 Knapsack problem
--   [Coin Change](/solution/0300-0399/0322.Coin%20Change/README_EN.md) -Unbounded Knapsack problem
+-   [Coin Change](/solution/0300-0399/0322.Coin%20Change/README_EN.md) - Unbounded Knapsack problem
+-   [Combination Sum IV](/solution/0300-0399/0377.Combination%20Sum%20IV/README_EN.md) - Unbounded Knapsack problem
 
 ### 4. Advanced Data Structures
 

solution/0300-0399/0377.Combination Sum IV/README.md

@@ -55,7 +55,11 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-简单动态规划，`dp[i]` 表示总和为 `i` 的元素组合的个数。
+**方法一：动态规划**
+
+类似完全背包问题，每个整数可以选择多次。但这里需要考虑整数的顺序，只要出现顺序不同，就视为一种方案。因此可以将 nums 放在内层循环中。
+
+`dp[i]` 表示总和为 `i` 的元素组合的个数。
 
 <!-- tabs:start -->
 
@@ -133,6 +137,28 @@ func combinationSum4(nums []int, target int) int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var combinationSum4 = function (nums, target) {
+    const dp = new Array(target + 1).fill(0);
+    dp[0] = 1;
+    for (let i = 1; i <= target; ++i) {
+        for (let v of nums) {
+            if (i >= v) {
+                dp[i] += dp[i - v];
+            }
+        }
+    }
+    return dp[target];
+};
+```
+
 ### **...**
 
 ```

solution/0300-0399/0377.Combination Sum IV/README_EN.md

@@ -124,6 +124,28 @@ func combinationSum4(nums []int, target int) int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var combinationSum4 = function (nums, target) {
+    const dp = new Array(target + 1).fill(0);
+    dp[0] = 1;
+    for (let i = 1; i <= target; ++i) {
+        for (let v of nums) {
+            if (i >= v) {
+                dp[i] += dp[i - v];
+            }
+        }
+    }
+    return dp[target];
+};
+```
+
 ### **...**
 
 ```

solution/0300-0399/0377.Combination Sum IV/Solution.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var combinationSum4 = function (nums, target) {
+    const dp = new Array(target + 1).fill(0);
+    dp[0] = 1;
+    for (let i = 1; i <= target; ++i) {
+        for (let v of nums) {
+            if (i >= v) {
+                dp[i] += dp[i - v];
+            }
+        }
+    }
+    return dp[target];
+};