【LeetCode】67. Add Binary

最新推荐文章于 2024-09-16 06:54:08 发布

ctrl23

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量271

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/jeff_35/article/details/53428151

版权

leetcode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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

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

public class AddBinary {
    /**
     *  Math. String.
     * Initialize two pointers i and j at the end of a and b.
     * Use one integer c for the carry.
     * While i >= 0 or j >= 0 or c == 1:
     * | Add char in a or 0 to carry c. Move i.
     * | Add char in b or 0 to carry c. Move j.
     * | c % 2 is the current digit.
     * | Insert current digit to the front of result.
     * | c / 2 is the next carry.
     * Return result string.
     * @param a
     * @param b
     * @return
     */
    public String addBinary(String a, String b) {
        int i = a.length() - 1;
        int j = b.length() - 1;
        int c = 0;
        StringBuilder sb = new StringBuilder();
        while(i >=0 || j >= 0 || c == 1) {
            c += (i >= 0 ? a.charAt(i--) - '0' : 0);
            c += (j >= 0 ? b.charAt(j--) - '0' : 0);
            sb.insert(0, c % 2);
            c >>= 1;
        }
        return sb.toString();
    }
    public String addBinary1(String a, String b) {
        int m = a.length();
        int n = b.length();
        int carry = 0;
        StringBuilder sb = new StringBuilder();
        int i = 0;
        while(i < m || i < n) {
            int p = i < m ? a.charAt(m - 1 - i) - '0' : 0;
            int q = i < n ? b.charAt(n - 1 - i) - '0' : 0;
            int temp = p + q + carry;
            carry = temp / 2;
            sb.insert(0, temp % 2);
            i++;
        }
        return carry == 0 ? sb.toString() : "1" + sb.toString();
    }
}