solution_474

LeetCode Problem Description

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:

1. The given numbers of 0s and 1s will both not exceed 100
2. 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

I got the idea from here. I thouht this method is tricky and it show me a general method to solve these kind problems. The code is as following:

class Solution {
public:
    int findMaxForm(vector<string>& strs, int m, int n) {
        vector< vector<int> > memo(m+1, vector<int>(n+1, 0));
        int numZeroes, numOnes;

        for (auto &s : strs) {
            numZeroes = numOnes = 0;
            for (auto c : s) {
                if (c == '0')
                    numZeroes++;
                else if (c == '1')
                    numOnes++;
            }
            for (int i = m; i >= numZeroes; i--) {
                for (int j = n; j >= numOnes; j--) {
                    memo[i][j] = max(memo[i][j], memo[i - numZeroes][j - numOnes] + 1);
                }
            }
        }
        return memo[m][n];
    }
};

As we can see, I build a 2D vector to store the max number of strings that can be formed with i zeros and j ones in the location memo[i][j]. For every string, I will calculate its numbers of zeros and ones. Then for every location whose coordinates satisfying that i >= numZeros and j >= numOnes, they can update their values. Just repeat this method and then at last we can get the maximum value of m zeros and n ones at the location (m, n)