LeetCode-67. Add Binary [C++][Java]

最新推荐文章于 2024-10-16 10:13:45 发布

贫道绝缘子

最新推荐文章于 2024-10-16 10:13:45 发布

阅读量1.1k

点赞数

分类专栏： LeetCode刷题怪文章标签： leetcode 算法 java

本文链接：https://blog.csdn.net/qq_15711195/article/details/123697008

版权

LeetCode刷题怪专栏收录该内容

230 篇文章 3 订阅

订阅专栏

这篇博客介绍了如何解决LeetCode上的一个问题——将两个二进制字符串相加。提供了C++和Java两种语言的解决方案，代码中通过遍历字符串从后向前，逐位相加，并处理进位情况，最后得到结果二进制字符串。

摘要由CSDN通过智能技术生成

Loading...https://leetcode.com/problems/add-binary/

题目描述

Given two binary strings a and b, return their sum as a binary string.

Example 1:

Input: a = "11", b = "1"
Output: "100"

Example 2:

Input: a = "1010", b = "1011"
Output: "10101"

Constraints:

1 <= a.length, b.length <= 10^4
a and b consist only of '0' or '1' characters.
Each string does not contain leading zeros except for the zero itself.

解题思路

【C++】

class Solution {
public:
    string addBinary(string a, string b) {
        int i = a.length() - 1;
        int j = b.length() - 1;
        string ans;
        int carry = 0;
        while (i >= 0 || j >= 0 || carry){
            if (i >= 0) {
                carry += a[i] - '0';
                i--;
            }
            if (j >= 0) {
                carry += b[j] - '0';
                j--;
            }
            ans = (char)(carry % 2 + '0') + ans;
            carry = carry / 2;
        }
        return ans;
    }
};

【Java】

class Solution {
    public String addBinary(String a, String b) {
        int i = a.length() - 1;
        int j = b.length() - 1;
        String ans = "";
        int carry = 0;
        while (i >= 0 || j >= 0 || carry > 0){
            if (i >= 0) {
                carry += a.charAt(i) - '0';
                i--;
            }
            if (j >= 0) {
                carry += b.charAt(j) - '0';
                j--;
            }
            ans = (char)(carry % 2 + '0') + ans;
            carry = carry / 2;
        }
        return ans;
    }
}