逆序遍历相加和,保存进位到下一位的相加,flag为1则进位。最后一位为1则要拓展空间。最后将数组以中间反转输出。
char* addBinary(char* a, char* b) {
int flag = 0;
int tempa, tempb;
int lena = strlen(a);
int lenb = strlen(b);
int max = (lena>lenb) ? lena : lenb;
char* sum= (char*)malloc(1+max*sizeof(char));
for (int i = 0; i<lena || i<lenb; i++)
{
tempa = (i < lena) ? a[lena-1-i] - '0' : 0;
tempb = (i < lenb) ? b[lenb-1-i] - '0' : 0;
sum[i] = (tempa + tempb + flag) % 2 + '0';
flag = (tempa + tempb + flag) / 2;
}
if (flag == 1)
{
max = max + 1;
sum = (char*)realloc(sum, 1+max*sizeof(char));
sum[max-1] = '1';
}
else
{
max = max;
}
for (int i = 0; i < max/2; i++)
{
int tem;
tem = sum[i];
sum[i] = sum[max-1-i];
sum[max-1-i] = tem;
}
sum[max] = '\0';
return sum;
}