[leetcode] 474. Ones and Zeroes

Question:

In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.

For now, suppose you are a dominator of m 0s and n 1s respectively. On the other hand, there is an array with strings consisting of only 0s and 1s.

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.

Note:
The given numbers of 0s and 1s will both not exceed 100
The size of given string array won’t exceed 600.
Example 1:

Input: Array = {"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”

Example 2:

Input: Array = {"10", "0", "1"}, m = 1, n = 1
Output: 2

Explanation: You could form "10", but then you'd have nothing left. Better form "0" and "1".

Solution:

受限制的背包问题，重量理解为字符串的长度，限制则为0和1的个数，因此只要和一般的背包问题，维护一个数组 dp[i][j][k] 表示用 i 个 0 和 j 个 1 能得到的数组前 k 个字符串的最大值，则有状态转移方程：

dp[i][j][k] = max(dp[i][j][k-1], //表示不拿第k个字符串
                  dp[i-sk0][j-sk1][k-1]+1 // 表示拿第k个字符串)

其中 sk0 为第k个字符串0的个数，sk1 为第k个字符串1的个数。

class Solution {
public:
    int findMaxForm(vector<string>& strs, int m, int n) {
        if (strs.size() == 0) return 0;
        vector<vector<int>> dp(m+1, vector<int>(n+1, 0));
        for (auto s : strs) {
            auto tv = cacl(s);
            for (int i = m; i >= tv[0]; i--) {
                for (int j = n; j >= tv[1]; j--) {
                    dp[i][j] = max(dp[i][j], dp[i-tv[0]][j-tv[1]]+1);
                }
            }
        }
        return dp[m][n];
    }

    vector<int> cacl(string & str) {
        vector<int> ret(2, 0);
        for (char c : str) {
            if (c == '0')
                ret[0]++;
            else
                ret[1]++;
        }
        return ret;
    }
};