From 17f24ae62179b550b439ee14b595a03b6a46f53b Mon Sep 17 00:00:00 2001
From: nanhuaibeian <49868746+nanhuaibeian@users.noreply.github.com>
Date: Wed, 12 May 2021 20:57:43 +0800
Subject: [PATCH] =?UTF-8?q?Update=200377.=E7=BB=84=E5=90=88=E6=80=BB?=
 =?UTF-8?q?=E5=92=8C=E2=85=A3.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0377.组合总和Ⅳ.md | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)

diff --git a/problems/0377.组合总和Ⅳ.md b/problems/0377.组合总和Ⅳ.md
index b0b83718..8f8cfd86 100644
--- a/problems/0377.组合总和Ⅳ.md
+++ b/problems/0377.组合总和Ⅳ.md
@@ -147,7 +147,23 @@ C++测试用例有超过两个树相加超过int的数据，所以需要在if里
 
 
 Java：
+```Java
+class Solution {
+    public int combinationSum4(int[] nums, int target) {
+        int[] dp = new int[target + 1];
+        dp[0] = 1;
+        for (int i = 0; i <= target; i++) {
+            for (int j = 0; j < nums.length; j++) {
+                if (i >= nums[j]) {
+                    dp[i] += dp[i - nums[j]];
+                }
+            }
+        }
+        return dp[target];
+    }
+}
 
+```
 
 Python：