内容简介: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.难度: 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"
难度: easy
题目:
给定两个二进制字符串,返回它们的和(也是二进制字符串)。
字符串都不为空且只有0、1组成。
Runtime: 2 ms, faster than 95.70% of Java online submissions for Add Binary.
Memory Usage: 26.2 MB, less than 54.54% of Java online submissions for Add Binary.
public class Solution {
public String addBinary(String a, String b) {
int i = a.length() - 1, j = b.length() - 1, carry = 0;
StringBuilder result = new StringBuilder();
while (i >= 0 || j >= 0) {
char ac = i >= 0 ? a.charAt(i) : '0';
char bc = j >= 0 ? b.charAt(j) : '0';
int sum = (ac - '0') + (bc - '0') + carry;
result.append(sum % 2);
carry = sum / 2;
i--;
j--;
}
if (carry > 0) {
result.append(1);
}
return new String(result.reverse());
}
}
以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持 码农网
本站部分资源来源于网络,本站转载出于传递更多信息之目的,版权归原作者或者来源机构所有,如转载稿涉及版权问题,请联系我们。
Head First Design Patterns
Elisabeth Freeman、Eric Freeman、Bert Bates、Kathy Sierra、Elisabeth Robson / O'Reilly Media / 2004-11-1 / USD 49.99
You're not alone. At any given moment, somewhere in the world someone struggles with the same software design problems you have. You know you don't want to reinvent the wheel (or worse, a flat tire),......一起来看看 《Head First Design Patterns》 这本书的介绍吧!
HTML 压缩/解压工具
在线压缩/解压 HTML 代码
RGB CMYK 转换工具
RGB CMYK 互转工具