474. Ones and Zeroes

class Solution {
public:
    int findMaxForm(vector<string>& strs, int m, int n) {
        if(strs.empty())
            return 0;
        vector<vector<int>> form(m+1,vector<int>(n+1,0));
        for(int row=0;row<strs.size();row++){
            int zeronum=0,onenum=0;
            for(int cal=0;cal<strs[row].size();cal++){
                if(strs[row][cal]=='0')
                    zeronum++;
                else
                    onenum++;
            }
            for(int i=m;i>=zeronum;i--){
                for(int j=n;j>=onenum;j--){
                    form[i][j]=max(form[i][j],form[i-zeronum][j-onenum]+1);
                }
            }
        }
        return form[m][n];
    }
};