Problem 1 Add Binary

Example:

• s = '121' --> index =2

• int number = s.charAt(2) - '0'

需要两个指针，从a/b.length -1 一直--

Mid Level:

public String addBinary(String a, String b) {
    int i = a.length() - 1;
    int j = b.length() - 1;
    int carry - 0;
    StirngBuilder sb = new StirngBuilder();
    while (i >= 0 || j >= 0){
        // int sum = carry + int(a[i] + b[i]);
        int sum = carry;
        if (i >= 0) {// 判断不出界
            sum += a.charAt(i) - '0';
        }
        if (j >= 0) {
            sum += b.charAt(j) - '0';
        }
        carry = sum / 2; 
        sb.append(sum % 2);
        i--;
        j--;
    }
    if (carry != 0) {
        sb.append(carry);
    }
    return sb.reverse().toString();
}

TC: O(m+ n)

SC: O(max(m, n))