【LeetCode】67 Add Binary

最新推荐文章于 2016-06-13 10:54:12 发布
最新推荐文章于 2016-06-13 10:54:12 发布
阅读量390 收藏
点赞数
分类专栏： LeetCode 文章标签： leetcode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/yuanzexi/article/details/50178029
版权

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

For example,
a = “11”
b = “1”
Return “100”.

Summary:
Array[i] is faster than String.charAt(int i);

Method 1 : (4ms)

public class Solution {
    public String addBinary(String a, String b) {
        int indexa = a.length() - 1;
        int indexb = b.length() - 1;
        char[] result = new char[indexa > indexb ? indexa+2 : indexb+2];
        int index = result.length-1;
        byte[] arr1 = a.getBytes();
        byte[] arr2 = b.getBytes();
        byte carry = 48;
        while(indexa >= 0 && indexb >= 0){
            if((arr1[indexa] ^arr2[indexb]) != 0){
                if(carry != 48){
                    result[index--] = '0';
                }else{
                    result[index--] = '1';
                }
            }else{
                if(carry != 48 ){
                    result[index--] = '1';
                    if(a.charAt(indexa) == '0'){
                        carry = 48;
                    }
                }else{
                    result[index--] = '0';
                    if(a.charAt(indexa) == '1'){
                        carry = 49;
                    }
                }
            }
            indexa--;
            indexb--;

        }
        while(indexa >= 0){
            if((arr1[indexa] ^ carry) != 0){
                result[index--] = '1';
                carry = 48;
            }else{
                result[index--] = '0';
            }
            indexa--;
        }
        while(indexb >= 0){
            if((arr2[indexb] ^ carry) != 0){
                result[index--] = '1';
                carry = 48;
            }else{
                result[index--] = '0';
            }
            indexb--;
        }
        if(carry != 48){
            result[index--] = '1';
        }
        return String.valueOf(result).trim();
    }
}

Method 2:(6ms)

public class Solution {
    public String addBinary(String a, String b) {
        int indexa = a.length() - 1;
        int indexb = b.length() - 1;
        byte[] arr1 = a.getBytes();
        byte[] arr2 = b.getBytes();
        StringBuffer sb = new StringBuffer();
        int carry = 48;
        while(indexa >= 0 && indexb >= 0){
            if((arr1[indexa] ^arr2[indexb]) != 0){
                if(carry != 48){
                    sb.insert(0, "0");
                }else{
                    sb.insert(0, "1");
                }
            }else{
                if(carry != 48 ){
                    sb.insert(0, "1");
                    if(a.charAt(indexa) == '0'){
                        carry = 48;
                    }
                }else{
                    sb.insert(0, "0");
                    if(a.charAt(indexa) == '1'){
                        carry = 49;
                    }
                }
            }
            indexa--;
            indexb--;

        }
        while(indexa >= 0){
            if((arr1[indexa] ^ carry) != 0){
                sb.insert(0, "1");
                carry = 48;
            }else{
                sb.insert(0, "0");
            }
            indexa--;
        }
        while(indexb >= 0){
            if((arr2[indexb] ^ carry) != 0){
                sb.insert(0, "1");
                carry = 48;
            }else{
                sb.insert(0, "0");
            }
            indexb--;
        }
        if(carry != 48){
            sb.insert(0, "1");
        }
        return sb.toString();
    }
}

Method 3:(9ms)

public class Solution {
    public String addBinary(String a, String b) {
        int indexa = a.length() - 1;
        int indexb = b.length() - 1;
        StringBuffer sb = new StringBuffer();
        int carry = 0;
        while(indexa >= 0 && indexb >= 0){
            if((Integer.parseInt(a.charAt(indexa)+"") ^ Integer.parseInt(b.charAt(indexb)+"")) != 0){
                if(carry != 0){
                    sb.insert(0, "0");
                }else{
                    sb.insert(0, "1");
                }
            }else{
                if(carry != 0 ){
                    sb.insert(0, "1");
                    if(a.charAt(indexa) == '0'){
                        carry = 0;
                    }
                }else{
                    sb.insert(0, "0");
                    if(a.charAt(indexa) == '1'){
                        carry = 1;
                    }
                }
            }
            indexa--;
            indexb--;

        }
        while(indexa >= 0){
            if((Integer.parseInt(a.charAt(indexa)+"") ^ carry) != 0){
                sb.insert(0, "1");
                carry = 0;
            }else{
                sb.insert(0, "0");
            }
            indexa--;
        }
        while(indexb >= 0){
            if((Integer.parseInt(b.charAt(indexb)+"") ^ carry) != 0){
                sb.insert(0, "1");
                carry = 0;
            }else{
                sb.insert(0, "0");
            }
            indexb--;
        }
        if(carry != 0){
            sb.insert(0, "1");
        }
        return sb.toString();
    }
}
正努力学English的程序猿
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
LeetCode刷题笔记--67. Add Binary
vivian0239的博客
02-22 299
67. Add Binary Easy 814166FavoriteShare Given two binary strings, return their sum (also a binary string). The input strings are both non-empty and contains only characters 1 or 0. Example 1: I...
leetcode解题之67 # Add Binary Java版
mine_song的博客
03-13 995
leetcode解题之67 # Add Binary Java版
LeetCode 67 Add Binary（二进制相加）（*）
nomasp
02-02 3015
翻译给定两个二进制字符串，返回它们的和（也是二进制字符串）。例如， a = "11" b = "1" 返回 "100".原文Given two binary strings, return their sum (also a binary string).For example, a = "11" b = "1" Return "100".分析我一开始写了这个算法，虽然实现了功能，不过不符合题目的用
leetcode 67 Add Binary
shiter编写程序的艺术
07-05 4459
Add Binary Total Accepted: 46815 Total Submissions: 189215 My Submissions                       Given two binary strings, return their sum (also a binary string). For example, a =
leetcode 67 Add Binary C++
wcxdell的专栏
06-13 1233
先对齐，在相加，注意进位即可。 string addBinary(string a, string b) { bool flag = false; int aSize = a.size(); int bSize = b.size(); while(aSize>bSize){ b = '0' + b;
67.addBinary.playground.zip
09-02
标题中的“67.addBinary.playground.zip”表明这是一个与LeetCode第67题相关的Swift编程练习项目。LeetCode是一个在线平台，提供各种算法题目供程序员练习和提升编程技能。第67题通常指的是将两个二进制数相加的问题...
java-leetcode题解之第67题二进制求和.zip
最新发布
05-29
LeetCode的第67题，也被称为“Add Binary”，要求我们将两个非负整数表示为二进制字符串，然后将它们相加，返回结果的二进制形式。这个问题的核心在于理解二进制运算的规则，包括二进位的加法（0+0=0, 0+1=1, 1+0=1,...
c++-c++编程基础之leetcode题解第67题二进制求和.zip
04-16
std::string addBinary(std::string a, std::string b) { int carry = 0; // 进位标志 int i = a.length() - 1, j = b.length() - 1; while (i >= 0 || j >= 0 || carry) { // 当遍历完所有位或者没有进位时...
leetcode题目分类
12-10
- Add Two Numbers（两数相加）：以链表的形式表示两个非负整数，并将其相加。 - Longest Substring Without Repeating Characters（无重复字符的最长子串）：找出无重复字符的最长子串的长度。 - Median of Two ...
LeetCode leetcode部分题解答代码实现
11-27
* Add Binary：给定两个二进制字符串，返回其和。这个题目需要使用数学的思想，将二进制字符串转换为整数，并返回其和。 * Basic Calculator II：给定一个字符串，返回其计算结果。这个题目需要使用数学的思想，将...
【LeetCode】206. Reverse Linked List
正努力学English的程序猿
03-25 815
Question： Reverse a singly linked list. Hint: A linked list can be reversed either iteratively or recursively. Could you implement both? My solution (recursion): 1ms/** * Definition for sing
【LeetCode】226. Invert Binary Tree
正努力学English的程序猿
03-24 377
Question：Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9to 4 / \ 7 2 / \ / \ 9 6 3 1Solution：My solution （No recursion）：1ms/** * Definition for a binary tre
【Leetcode】100. Same Tree
正努力学English的程序猿
03-25 358
Question： Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same valu
【LeetCode】119 Pascal's Triangle II
正努力学English的程序猿
12-03 340
Pascal’s TriangleGiven an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1].Note: Could you optimize your algorithm to use only O(k) extra space?Method 1
【LeetCode】172. Factorial Trailing Zeroes
正努力学English的程序猿
12-19 339
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.Method 2 is original by myself. It is very close to Method 1, i need think mo
【LeetCode】258. Add Digits
正努力学English的程序猿
12-01 323
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, r
【LeetCode】231 Power of Two
正努力学English的程序猿
12-01 319
Given an integer, write a function to determine if it is a power of two.思路： 求是否是2的幂，由2可以联想到2进制，只要数的2进制表示中只含有一个值为1的bit位，这个数即是2的幂。 法2用Integer.bitCount(int i)方法，该方法虽然只需一行即可解决问题，但是所需的时间却比自己写的法1更多
【LeetCode】292.Nim Game
正努力学English的程序猿
12-01 318
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the
LeetCode 清洁代码实战：50道经典题解
21. **Add Two Numbers** - 将两个表示整数的链表相加。 22. **Swap Nodes in Pairs** - 交换链表中的相邻节点成对。 23. **Merge k Sorted Lists** - 合并k个已排序的链表。 24. **Copy List with Random Pointer**...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值