aboutsummaryrefslogtreecommitdiff
path: root/Computer_Science/leetcode/67-add_binary.c
blob: 48e4744fee88c17555e73ab7cb3e597bd8a53e0a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#define MAX(a, b) ((a) > (b) ? (a) : (b))
char* addBinary(char* a, char* b) {
	int lenA = strlen(a);
	int lenB = strlen(b);

	int len = MAX(lenA, lenB) + 1;
	char* result = malloc(sizeof(char) * (len + 1));
	result[len--] = '\0';
	char in = '0';
	int sum = 0;

	lenA--;
	lenB--;

	if(len == 0) return "0";
	
	while(lenA >= 0 && lenB >=0) {
		sum = a[lenA] + b[lenB] + in - 3 * '0';
		switch(sum) {
		case 0:
			in = '0';
			result[len] = '0';
			break;
		case 1:
			in = '0';
			result[len] = '1';
			break;
		case 2:
			in = '1';
			result[len] = '0';
			break;
		case 3:
			in = '1';
			result[len] = '1';
			break;
		}
		lenA--;
		lenB--;
		len--;
	}

	while(lenA >= 0) {
		if(in == '0') {
			result[len] = a[lenA];
		} else if(a[lenA] == '1') {
			result[len] = '0';
			in = '1';
		} else {
			result[len] = '1';
			in = '0';
		}
		lenA--;
		len--;
	}

	while(lenB >= 0) {
		if(in == '0') {
			result[len] = b[lenB];
		} else if(b[lenB] == '1') {
			result[len] = '0';
			in = '1';
		} else {
			result[len] = '1';
			in = '0';
		}
		lenB--;
		len--;
	}

	if(in == '0')
		return result + 1;

	*result = '1';
	return result;
}