leetcode #67 in cpp

来源：互联网发布：竞彩缩水软件编辑：程序博客网时间：2024/06/03 21:22

Solution:

It is the same as #66. We use 2 instead of 10 as the modulo.

Code:

class Solution {public:    string addBinary(string a, string b) {        int carry = 0;        if(a.length() < b.length()){            string temp = a;            a = b;            b = temp;        }        int alen = a.length();        int blen = b.length();        int i = 0;        while(i<alen){            if(i<blen){                if(a[alen - i - 1] - '0' + b[blen - i - 1]-'0' + carry>=2){                    a[alen - i - 1] = (a[alen - i - 1] - '0' + b[blen - i - 1]-'0' + carry) % 2 + '0';                    carry = 1;                  }                 else{                    a[alen - i - 1] = (a[alen - i - 1] - '0' + b[blen - i - 1]-'0' + carry) + '0';                    carry = 0;                }            }else{                if(a[alen - i - 1] - '0' + carry>=2){                    a[alen - i - 1] = (a[alen - i - 1] - '0' + carry) % 2 + '0';                    carry = 1;                  }else{                    a[alen - i - 1] = (a[alen - i - 1] - '0' + carry) + '0';                    carry = 0;                    break;                }            }            i++;        }        if(carry) a = '1' + a;        return a;    }};

0 0