From 242c2120bbe15ce34187aba3aa5d35ed0a05914b Mon Sep 17 00:00:00 2001
From: nanhuaibeian <49868746+nanhuaibeian@users.noreply.github.com>
Date: Wed, 12 May 2021 20:55:32 +0800
Subject: [PATCH] =?UTF-8?q?Update=200474.=E4=B8=80=E5=92=8C=E9=9B=B6.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0474.一和零.md | 28 +++++++++++++++++++++++++++-
 1 file changed, 27 insertions(+), 1 deletion(-)

diff --git a/problems/0474.一和零.md b/problems/0474.一和零.md
index 7970c38e..4ec5fd4d 100644
--- a/problems/0474.一和零.md
+++ b/problems/0474.一和零.md
@@ -161,7 +161,33 @@ public:
 
 
 Java：
-
+```Java
+class Solution {
+    public int findMaxForm(String[] strs, int m, int n) {
+        //dp[i][j]表示i个0和j个1时的最大子集
+        int[][] dp = new int[m + 1][n + 1];
+        int oneNum, zeroNum;
+        for (String str : strs) {
+            oneNum = 0;
+            zeroNum = 0;
+            for (char ch : str.toCharArray()) {
+                if (ch == '0') {
+                    zeroNum++;
+                } else {
+                    oneNum++;
+                }
+            }
+            //倒序遍历
+            for (int i = m; i >= zeroNum; i--) {
+                for (int j = n; j >= oneNum; j--) {
+                    dp[i][j] = Math.max(dp[i][j], dp[i - zeroNum][j - oneNum] + 1);
+                }
+            }
+        }
+        return dp[m][n];
+    }
+}
+```
 
 Python：