AddBinary（leetcode）

package practice.m3.d20;
/* Given two binary strings, return their sum (also a binary string).
 * For example,
 * a = "11"
 * b = "1"
 * Return "100".
 */
public class AddBinary {
    public String addBinary(String a, String b) {
        if (a == null || a.length() == 0)
            return b;
        if (b == null || b.length() == 0)
            return a;
        int i = a.length() - 1;
        int j = b.length() - 1;
        int carry = 0;
        StringBuilder res = new StringBuilder();
        while (i >= 0 && j >= 0) {
            int digit = (int) (a.charAt(i) - '0' + b.charAt(j) - '0') + carry;//carry是进位，对应为转化为int 相加 
            carry = digit / 2;//进位
            digit %= 2;//求余得到目前位的数值
            res.insert(0, digit);//StringBuffer在低位添加这个数
            i--;
            j--;
        }
        //直到一方位数相加完
        while (i >= 0) {
            int digit = (int) (a.charAt(i) - '0') + carry;
            carry = digit / 2;
            digit %= 2;
            res.insert(0, digit);
            i--;
        }
        while (j >= 0) {
            int digit = (int) (b.charAt(j) - '0') + carry;
            carry = digit / 2;
            digit %= 2;
            res.insert(0, digit);
            j--;
        }
        if (carry > 0) {//剩下进位添加到StringBuffer
            res.insert(0, carry);
        }
        return res.toString();
    }
}

思路：两个字符串高位对其（转化为 int）直接相加,设置进位标志carry,直到一方相加完毕，剩下的长度长的字符串与剩下进位在进行类似相加，知道结束。