leetcode 67:二进制求和

std::string addBinary(std::string a, std::string b) {
    std::string s1=a.size()>=b.size()?a:b;
    std::string s2=a.size()<b.size()?a:b;
    int max=std::max(a.size(),b.size());
    int min=std::min(a.size(),b.size());
    for(int i=0;i<max-min;i++)
        s2.insert(s2.begin(),'0');

    std::string ss="";
    int c=0;
    int f=0;
    int aa,bb;
    for(int i=max-1;i>=0;i--){
        aa=s1[i]-'0';
        bb=s2[i]-'0';
        c=(aa+bb+f)%2;
        f=(aa+bb+f)/2;
        ss.insert(ss.begin(),c+'0');
    }
    if(f!=0)
        ss.insert(ss.begin(),f+'0');

     return ss;
}