add binary

最新推荐文章于 2018-09-23 20:59:58 发布

wishingweed

最新推荐文章于 2018-09-23 20:59:58 发布

阅读量401

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u010484308/article/details/41226007

版权

leetcode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

class Solution {
public:
    string addBinary(string a, string b) {
    int lengtha = a.length();
    int lengthb = b.length();
    int length = 0;
    if(lengthb > lengtha)
        length = lengtha;
    else
        length = lengthb;
    int carry = 0;
    string str = "";
    for(int i = 0;i<length;i++)
    {
        int temp = 0;
        temp = a[lengtha-1]-'0'+b[lengthb-1]-'0' +carry;
        if(temp == 3)
        {
            str = str + '1';
            carry = 1;
        }
        if(temp == 2)
        {
            str = str+'0';
            carry = 1;
        }
        if(temp == 1)
        {
            str = str + '1';
            carry = 0;
        }
        if(temp == 0)
        {
            str = str + '0';
            carry = 0;
        }
        lengtha --;
        lengthb --;
    }
    while(lengtha!= 0)
    {
        int temp = a[lengtha-1]-'0'+carry;
        if(temp == 2)
        {
            str = str+'0';
            carry = 1;
        }
        if(temp == 1)
        {
            str = str + '1';
            carry = 0;
        }
        if(temp == 0)
        {
            str = str + '0';
            carry = 0;
        }
        lengtha --;
    }
    while(lengthb!= 0)
    {
     int temp = b[lengthb-1] - '0'+carry;
     if(temp == 2)
        {
            str = str+'0';
            carry = 1;
        }
        if(temp == 1)
        {
            str = str + '1';
            carry = 0;
        }
        if(temp == 0)
        {
            str = str + '0';
            carry = 0;
        }
        lengthb --;
        
    }
    if(carry)
        str = str+'1';
    reverse(str.begin(),str.end());
    return str;
    }
};