LeetCode: Add Binary

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

Tingmei

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

阅读量896

点赞数

分类专栏：算法 C++ 文章标签： string function class

本文链接：https://blog.csdn.net/Tingmei/article/details/8033812

版权

算法同时被 2 个专栏收录

109 篇文章 0 订阅

订阅专栏

C++

108 篇文章 0 订阅

订阅专栏

Problem

Given two binary strings, return their sum (also a binary string).

For example,
a = "11"
b = "1"
Return "100".

即模拟加法运算。

class Solution {
public:
    string addBinary(string a, string b) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        string strResult;
        int idxA = a.size() - 1;
        int idxB = b.size() - 1;
        int carry = 0;
        while(idxA >= 0 && idxB >= 0)
        {
            int sum = a[idxA] - '0' + b[idxB] - '0' + carry;
            if (sum == 3)
            {
                strResult.append("1");
                carry = true;
            }
            else if (sum == 2)
            {
                strResult.append("0");
                carry = true;
            }
            else if (sum == 1)
            {
                strResult.append("1");
                carry = false;
                
            }
            else
            {
                strResult.append("0");
                carry = false;
            }
            --idxA;
            --idxB;
        }
        
        if (idxA >=0)
        {
            while(idxA >= 0)
            {
                int sum = a[idxA] - '0' + carry;
                if (sum == 2)
                {
                    strResult.append("0");
                    carry = true;
                }
                else if (sum == 1)
                {
                    strResult.append("1");
                    carry = false;
                
                }
                else
                {
                    strResult.append("0");
                    carry = false;
                }
                --idxA;
            }
        }
        else
        {
             while(idxB >= 0)
            {
                int sum = b[idxB] - '0' + carry;
                if (sum == 2)
                {
                    strResult.append("0");
                    carry = true;
                }
                else if (sum == 1)
                {
                    strResult.append("1");
                    carry = false;
                
                }
                else
                {
                    strResult.append("0");
                    carry = false;
                }
                --idxB;
            }
        }
        
    	if (carry == 1)
            strResult.append("1");

        string result(strResult.rbegin(),strResult.rend());  
        return result;
    }
};