LEETCODE: Add Binary

最新推荐文章于 2025-12-03 17:03:32 发布

原创最新推荐文章于 2025-12-03 17:03:32 发布 · 266 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LEETCODE #算法 #二进制 #合并

LEETCODE 专栏收录该内容

153 篇文章

订阅专栏

本文介绍了一个用于计算两个二进制字符串和的算法，通过实例演示了如何将两个给定的二进制字符串相加并返回其二进制形式的和。

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) {
        int longstr = a.length() > b.length() ? a.length() : b.length();
        int shortstr = a.length() < b.length() ? a.length() : b.length();
        string result(longstr + 1, '0');
        int jinwei = 0;
        int ii = 0;
        
        //Calculate if both string has value.
        for(; ii < shortstr; ii ++) {
            int sum = a[a.length() - 1 - ii] - '0' + b[b.length() - 1 - ii] -'0' + jinwei;
            if(sum >= 2) {
                jinwei = 1;
                sum = sum % 2;
            }
            else {
                jinwei = 0;
            }
            result[result.length() - 1 - ii] = sum + '0';
        }
        
        //Calculate the remain string.
        string &remain = a.length() > b.length() ? a : b;
        for(; ii < longstr; ii ++) {
            int sum = remain[remain.length() - 1 - ii] - '0' + jinwei;
            if(sum >= 2) {
                jinwei = 1;
                sum = sum % 2;
            }
            else {
                jinwei = 0;
            }
            result[result.length() - 1 - ii] = sum + '0';
        }
        
        //Set if there is jinwei.
        if(jinwei == 1) {
            result[0] = '1';
        }
        else {
            result = result.substr(1, result.length() - 1);
        }
        
        return result;
    }
};