思路:
例如 11 + 1
从a,b的最后一位开始遍历相加 ,位数不够补0;
只有当a,b和进位数都无时结束循环。
sum的最大值为3
/**
* @param {string} a
* @param {string} b
* @return {string}
*/
var addBinary = function(a, b) {
let res =[];
let jin = 0;
let i = a.length-1;
let j = b.length-1;
while(a[i]||b[j]||jin){
let aa = Number(a[i])?Number(a[i]):0;
let bb = Number(b[j])?Number(b[j]):0;
let sum = aa+bb+jin;
if(sum===3){
sum = 1;
jin = 1;
}else if(sum == 2){
sum = 0;
jin = 1;
}else{
jin = 0;
}
res.unshift(sum)
i--;
j--;
}
return res.join('')
}