67. 二进制求和(高精度加法)(Leetcode)

67. 二进制求和

class Solution {
public:
    string addBinary(string a, string b) {
        reverse(a.begin(), a.end());
        reverse(b.begin(), b.end());

        string c;
        int t = 0;
        for(int i = 0; i < a.size() || i < b.size() || t; ++i){
            if(i < a.size()) t += a[i] - '0';
            if(i < b.size()) t += b[i] - '0';
            c += to_string(t % 2);
            t /= 2;
        }

        reverse(c.begin(), c.end());
        return c;
    }
};