LeetCode - Add Binary

Question

Link:https://leetcode.com/problems/add-binary/
Given two binary strings, return their sum (also a binary string).

For example,
a = “11”
b = “1”
Return “100”.

Code

一个比较挫的算法。(C++ :4ms)

class Solution {
public:
    string addBinary(string a, string b) {
        int len = a.size() > b.size() ? a.size() : b.size();
        int carry = 0;
        string result = "";
        reverse(a.begin(), a.end());
        reverse(b.begin(), b.end());
        for(int i = 0; i < len; i++){
            if(i >= a.size()){ //b is longer than a
                if(b[i] == '1'){
                    if(carry == 1)
                        result.insert(0, "0", 0, 1);
                    else
                        result.insert(0, "1", 0, 1);
                }
                else{
                    if(carry == 1){
                        result.insert(0, "1", 0, 1);
                        carry = 0;
                    }
                    else
                        result.insert(0, "0", 0, 1);
                }
            }
            else if(i >= b.size()){ //a is longer than b
                if(a[i] == '1'){
                    if(carry == 1)
                        result.insert(0, "0", 0, 1);
                    else
                        result.insert(0, "1", 0, 1);
                }
                else{
                    if(carry == 1){
                        result.insert(0, "1", 0, 1);
                        carry = 0;
                    }
                    else
                        result.insert(0, "0", 0, 1);
                }
            }
            else{
                if(a[i] == '1' && b[i] == '1'){
                    if(carry == 1) 
                        result.insert(0, "1", 0, 1);
                    else 
                        result.insert(0, "0", 0, 1);
                    carry = 1;
                }
                else if(a[i] == '0' && b[i] == '0'){
                    if(carry == 0) // 0 + 0
                        result.insert(0, "0", 0, 1); 
                    else
                        result.insert(0, "1", 0, 1);
                    carry = 0;
                }
                else{
                    if(carry == 0) // 1 + 0
                        result.insert(0, "1", 0, 1);
                    else // 1 + 0 + 1(carry)
                        result.insert(0, "0", 0, 1);
                }
            }
        }
        if(carry == 1)
            result.insert(0, "1", 0, 1);
        return result;
    }
};
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值