对于每一位,都至少要有1个0,2个1,如果不足就要添加。
#include <bits/stdc++.h>
using namespace std;
int n,m;
class TheDevice {
public:
int minimumAdditional( vector <string> plates );
};
int TheDevice::minimumAdditional(vector <string> a) {
n=a.size();m=a[0].size();
int ans=0;
for(int j=0;j<m;j++){
int s0=0,s1=0,s=0;
for(int i=0;i<n;i++)
if (a[i][j]=='0') s0++;
else s1++;
if (s0==0) s++;
if (s1<2) s+=2-s1;
ans=max(ans,s);
}
return ans;
}