zoukankan      html  css  js  c++  java
  • LeetCode 67. Add Binary【个位补0,不必对齐】【easy】

    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:

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

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

    class Solution {
        public String addBinary(String a, String b) {
            StringBuilder sb = new StringBuilder();
            int i = a.length()-1, j = b.length()-1, carry = 0;
            while(i >= 0 || j >= 0){
                int sum = carry;
                if(i >= 0) sum += a.charAt(i--) - '0';
                if(j >= 0) sum += b.charAt(j--) - '0';
                sb.append(sum % 2);
                carry = sum / 2;
            }
            if(carry != 0) sb.append(carry);
            return sb.reverse().toString();
        }
    }
    
  • 相关阅读:
    ExtJs-学习篇(1)
    js中的Ajax经典示例
    软件工程开发流程
    Maven和Ajax
    搭建SSH框架
    拦截器
    OGNL
    Struts 2配置详解
    Struts 2入门
    HQL连接查询和注解
  • 原文地址:https://www.cnblogs.com/Roni-i/p/11184420.html
Copyright © 2011-2022 走看看