Leetcode: Add Binary

最新推荐文章于 2025-08-12 18:03:27 发布

原创最新推荐文章于 2025-08-12 18:03:27 发布 · 122 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#algorithm #面试

Leetcode 专栏收录该内容

154 篇文章

订阅专栏

本文介绍了一种使用C++实现的算法，该算法能够处理两个二进制字符串的加法运算，并返回结果作为新的二进制字符串。通过逐位进行加法并考虑进位的情况，确保了算法的正确性和效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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

c++:

class Solution {
public:
    string addBinary(string a, string b) {
        if(a.length() == 0)
        {
            return b;
        }
        if(b.length() == 0)
        {
            return a;
        }
        int lena = a.length();
        int lenb = b.length();
        int i = lena-1;
        int j = lenb-1;
        int carry = 0;
        int sum = 0;
        string c = "";
        while(i >= 0 && j >= 0)
        {
            sum = (a[i] - '0') + (b[j] - '0') + carry;
            carry = sum > 1 ? 1 : 0;
            sum = sum > 1 ? sum - 2 : sum;
            c = sum == 0 ? '0' + c : '1' + c;
            i --;
            j --;
        }
        while(i >= 0)
        {
            sum = carry + (a[i] - '0');
            carry = sum > 1 ? 1 : 0;
            sum = sum > 1 ? sum - 2 : sum;
            c = sum == 0 ? '0' + c : '1' + c;
            i--;
        }
        while(j >= 0)
        {
            sum = carry + (b[j] - '0');
            carry = sum > 1 ? 1 : 0;
            sum = sum > 1 ? sum - 2 : sum;
            c = sum == 0 ? '0' + c : '1' + c;
            j--;
        }
        if(carry == 1)
        {
            c = '1' + c;
        }
        return c;
    }
};