标签:style blog color java strong io for art
题目:
Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b = "1"
Return "100"
.
题解:
二进制加法都是从最低位(从右加到左)。所以对两个字符串要从最后一位开始加,如果遇见长度不一的情况,就把短的字符串高位补0.
每轮计算要加上进位,最后跳出循环后要坚持进位是否为1,以便更新结果。
代码如下(from discussion):
Add Binary Leetcode java,布布扣,bubuko.com
标签:style blog color java strong io for art
原文地址:http://www.cnblogs.com/springfor/p/3889228.html