LeetCode Add Binary |My Solution

最新推荐文章于 2024-06-07 15:46:49 发布

AresGod

最新推荐文章于 2024-06-07 15:46:49 发布

阅读量902

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/AresGod/article/details/40399811

LeetCode 专栏收录该内容

35 篇文章

订阅专栏

本文介绍了一种解决两个二进制字符串相加问题的方法。通过遍历输入字符串并逐位进行二进制加法运算，同时处理进位情况，最终得到正确的二进制和。该方法适用于计算机科学领域的编程面试和技术实现。

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

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

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

Show Tags

public class Solution {
    public String addBinary(String a, String b) {
        if (a == null || a.length() == 0) {
            return b;
        }
        if (b == null || b.length() == 0) {
            return a;
        }
        int addBits = Math.min(a.length(), b.length());
        StringBuffer sb = new StringBuffer();
        int bitPlus = 0;
        for (int i = 0; i < addBits; i++) {
          int aBit = a.charAt(a.length() - 1 - i) - '0';
          int bBit = b.charAt(b.length() - 1 - i) - '0';
          int cur = aBit + bBit + bitPlus;
          bitPlus = cur / 2;
          cur = cur % 2;
          sb.insert(0, String.valueOf(cur));
        }
      return  doOther( a,  b, addBits, bitPlus, sb); 
        
    }
    public String doOther(String a, String b, int addBits,int bitPlus,StringBuffer sb) {
        if (b.length() > a.length()) {
            doOther( b, a, addBits, bitPlus, sb); 
        } else {
            for (int i = addBits; i < a.length();i++)
            {
             int aBit = a.charAt(a.length() - 1 - i ) - '0';
             int cur = aBit + bitPlus;
             bitPlus = cur / 2;
             cur = cur % 2;
             sb.insert(0,String.valueOf(cur));
            }
            if (bitPlus == 1) {
                sb.insert(0,"1");
            }
            return sb.toString();
        }
        return sb.toString();

    }
}