Add Binary

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

</pre><p style="box-sizing: border-box; margin-top: 0px; margin-bottom: 10px; color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">For example,<br style="box-sizing: border-box;" />a = <code style="box-sizing: border-box; font-family: Menlo, Monaco, Consolas, "Courier New", monospace; font-size: 12.6px; padding: 2px 4px; color: rgb(199, 37, 78); background-color: rgb(249, 242, 244); border-radius: 4px;">"11"</code><br style="box-sizing: border-box;" />b = <code style="box-sizing: border-box; font-family: Menlo, Monaco, Consolas, "Courier New", monospace; font-size: 12.6px; padding: 2px 4px; color: rgb(199, 37, 78); background-color: rgb(249, 242, 244); border-radius: 4px;">"1"</code><br style="box-sizing: border-box;" />Return <code style="box-sizing: border-box; font-family: Menlo, Monaco, Consolas, "Courier New", monospace; font-size: 12.6px; padding: 2px 4px; color: rgb(199, 37, 78); background-color: rgb(249, 242, 244); border-radius: 4px;">"100"</code>.</p><p style="box-sizing: border-box; margin-top: 0px; margin-bottom: 10px; color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">二进制数加法和十进制数相同,从低位到高位,超过进制数就进一位。所以可以先对齐,然后每一位的两个数和进位数进行相加,超过进制就进一位。</p><p style="box-sizing: border-box; margin-top: 0px; margin-bottom: 10px; color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"><pre name="code" class="java">public class Solution {
    public String addBinary(String a, String b) {
        String s="";
        char[] c1;
        char[] c2;
        if(a.length() > b.length() ){
            c1 = a.toCharArray();
            c2 = b.toCharArray();
        }else{
            c1 = b.toCharArray();
            c2 = a.toCharArray();
        }
        int i = c1.length-1;
        int j = c2.length-1;
        int p = 0;                //进位数
        int sum = 0;
        for(; i>=0 ; i--,j-- ){
            if(j >= 0){
                sum = sumChar(c1[i],c2[j],p); 
            }else{
                sum = sumChar(c1[i],'0',p);
            }
            if(sum == 3){
                s = "1"+s;
                p = 1;
            }else if(sum == 2){
                s = "0" + s;
                p = 1;
            }else if(sum == 1){
                s = "1"+s;
                p = 0;
            }else{
                s = "0"+s;
                p = 0;
            }
        }
        if(p == 1){
            s = "1"+s;
        }
        return s;
    }
    public int sumChar(char a, char b, int p){   //计算每位数与进位数的和
        return a-'0' + b-'0' + p;
    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值