-
Notifications
You must be signed in to change notification settings - Fork 0
/
OneAndZeros.java
48 lines (42 loc) · 1.44 KB
/
OneAndZeros.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
package algorithm.topics.dp;
/**
* <a href="https://leetcode.cn/problems/ones-and-zeroes/">One and Zeros</a>
*
* @author marvin
* @version OneAndZeros.java, v 0.1 2022/10/06 23:38 Exp $
*/
public class OneAndZeros {
public int findMaxForm(String[] strs, int m, int n) {
int len = strs.length;
int[][][] dp = new int[len + 1][m + 1][n + 1];
for (int i = 1; i <= len; i++) {
int[] zerosOnes = getZerosOnes(strs[i - 1]);
int zeros = zerosOnes[0], ones = zerosOnes[1];
// m => 0
for (int j = 0; j <= m; j++) {
for (int k = 0; k <= n; k++) {
dp[i][j][k] = dp[i - 1][j][k];
if (j >= zeros && k >= ones) {
dp[i][j][k] = Math.max(dp[i][j][k], dp[i - 1][j - zeros][k - ones] + 1);
}
}
}
}
return dp[len][m][n];
}
public int[] getZerosOnes(String str) {
int[] zerosOnes = new int[2];
int length = str.length();
for (int i = 0; i < length; i++) {
zerosOnes[str.charAt(i) - '0']++;
}
return zerosOnes;
}
public static void main(String[] args) {
OneAndZeros oneAndZeros = new OneAndZeros();
String[] strs= new String[]{"10", "0001", "111001", "1", "0"};
int m = 5, n=3;
int ans = oneAndZeros.findMaxForm(strs, m, n);
System.out.println(ans);
}
}