474. Ones and Zeroes

Description:

Given an array, strs, with strings consisting of only 0s and 1s. Also two integers m and n.

Now your task is to find the maximum number of strings that you can form with given m 0s and n 1s. Each 0 and 1 can be used at most once.

Example 1:

Input: strs = [“10”,“0001”,“111001”,“1”,“0”], m = 5, n = 3
Output: 4
Explanation: This are totally 4 strings can be formed by the using of 5 0s and 3 1s, which are “10”,“0001”,“1”,“0”.

Solution:

动态规划dp系列练习题。
这是属于多限制的0-1背包问题，本质上除了三位数组比较抽象，原理和0-1背包差不多。

class Solution {
    public int findMaxForm(String[] strs, int m, int n) {
        int[][][] dp = new int[strs.length + 1][m + 1][n + 1];
        for(int i = 1; i < strs.length + 1; ++i) {
            int[] re = checkOneAndZero(strs[i - 1]);
            int zero = re[0];
            int one = re[1];
            for(int j = 0; j < m + 1; ++j)
                for(int k = 0; k < n + 1; ++k) {
                    //get
                    if(j >= zero && k >= one)
                        dp[i][j][k] = Math.max(dp[i - 1][j - zero][k - one] + 1, dp[i - 1][j][k]);
                    //not get
                    else
                        dp[i][j][k] = dp[i - 1][j][k];
                }
        }
        return dp[strs.length][m][n];
    }

    public int[] checkOneAndZero(String s){
        int[] res = new int[2];
        int zero = 0, one = 0;
        for(Character c : s.toCharArray()) {
            if(c == '0')
                zero++;
            else if(c == '1')
                one++;
        }
        res[0] = zero; res[1] = one;
        return res;
    }
}