LeetCode-67-二进制求和-C语言

int get_len(char *s){
    int i = 0;
    while(*s++ != '') i++;
    return i;
}

char* reverse(char *s, int len){
    int i=0, j=len-1;
    while(i<j){
        char tmp = s[i];s[i] = s[j];s[j] = tmp;
        i++;j--;
    }
    return s;
}

#define LEN 1000

char * addBinary(char * a, char * b){
    int len1 = get_len(a);
    int len2 = get_len(b);
    char *ret = (char *)malloc(sizeof(char) * (LEN));
    
    int i = 0;
    int j=0;
    int flag =0;
    int tmp;
    int index=0;
    
    memset(ret, 0, LEN);
    
    reverse(a,len1);
    reverse(b, len2);
    
    while(i<len1 || j<len2 || flag){
        tmp = flag + (i<len1?(a[i]-'0'):0) + (j<len2?(b[j]-'0'):0);
        printf("i=%d, j=%d, tmp=%d, flag=%dn", i, j, tmp, flag);
        flag = 0;
        if(tmp>=2){
            tmp -= 2;
            flag = 1;
        }
        ret[index++] = '0' + tmp;
        i++;
        j++;
    }

    
    return reverse(ret, index);
    
}

最后

以上就是飘逸毛衣最近收集整理的关于LeetCode-67-二进制求和-C语言的全部内容，更多相关LeetCode-67-二进制求和-C语言内容请搜索靠谱客的其他文章。