feat: add solutions to leetcode problem: No.0377. Combination Sum IV

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

@@ -56,22 +56,45 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+简单动态规划，`dp[i]` 表示总和为 `i` 的元素组合的个数。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def combinationSum4(self, nums: List[int], target: int) -> int:
+        dp = [0 for i in range(target + 1)]
+        dp[0] = 1
+        for i in range(1, target + 1):
+            for num in nums:
+                if i - num >= 0:
+                    dp[i] += dp[i - num]
+        return dp[target]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int combinationSum4(int[] nums, int target) {
+        int[] dp = new int[target + 1];
+        dp[0] = 1;
+        for (int i = 1; i <= target; i++) {
+            for (int num : nums) {
+                if (i - num >= 0) {
+                    dp[i] += dp[i - num];
+                }
+            }
+        }
+        return dp[target];
+    }
+}
 ```
 
 ### **...**

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

@@ -49,18 +49,41 @@ Note that different sequences are counted as different combinations.
 
 ## Solutions
 
+`dp[i]` represents the number of element combinations whose sum is `i`.
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def combinationSum4(self, nums: List[int], target: int) -> int:
+        dp = [0 for i in range(target + 1)]
+        dp[0] = 1
+        for i in range(1, target + 1):
+            for num in nums:
+                if i - num >= 0:
+                    dp[i] += dp[i - num]
+        return dp[target]
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int combinationSum4(int[] nums, int target) {
+        int[] dp = new int[target + 1];
+        dp[0] = 1;
+        for (int i = 1; i <= target; i++) {
+            for (int num : nums) {
+                if (i - num >= 0) {
+                    dp[i] += dp[i - num];
+                }
+            }
+        }
+        return dp[target];
+    }
+}
 ```
 
 ### **...**

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

@@ -1,27 +1,14 @@
 class Solution {
-        public int combinationSum4(int[] n, int target) {
+    public int combinationSum4(int[] nums, int target) {
         int[] dp = new int[target + 1];
-        Arrays.fill(dp, -1);
         dp[0] = 1;
-        return combinationSum4Dfs(n, dp, target);
-
-    }
-
-    private int combinationSum4Dfs(int[] n, int[] dp, int target) {
-        if (target < 0) {
-            return 0;
-        }
-
-        if (dp[target] != -1) {
-            return dp[target];
-        }
-
-        int rt = 0;
-        for (int v : n) {
-            rt += combinationSum4Dfs(n, dp, target - v);
+        for (int i = 1; i <= target; i++) {
+            for (int num : nums) {
+                if (i - num >= 0) {
+                    dp[i] += dp[i - num];
+                }
+            }
         }
-
-        dp[target] = rt;
         return dp[target];
     }
-}
+}

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

@@ -0,0 +1,9 @@
+class Solution:
+    def combinationSum4(self, nums: List[int], target: int) -> int:
+        dp = [0 for i in range(target + 1)]
+        dp[0] = 1
+        for i in range(1, target + 1):
+            for num in nums:
+                if i - num >= 0:
+                    dp[i] += dp[i - num]
+        return dp[target]