LeetCode-Solutions/67.add-binary.cpp at main · dec0deit/LeetCode-Solutions · GitHub

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
/*
 * @lc app=leetcode id=67 lang=cpp
 *
 * [67] Add Binary
 */

// @lc code=start
class Solution {
public:
    string addBinary(string a, string b) {

        if(a.length()>b.length()){
            swap(a,b);
        }

        reverse(a.begin(),a.end());
        reverse(b.begin(),b.end());
        int carry = 0;
        int i = 0;
        for(i=0;i<a.size();i++){
            int x = (a[i])-'0';
            int y = (b[i])-'0';

            if(carry + x + y == 3){
                b[i] = '1';
                carry = 1;
            }
            else if(carry + x + y == 2){
                b[i] = '0';
                carry = 1;
            }
            else if(carry + x + y == 1){
                carry = 0;
                b[i] = '1';
            }
            else if(carry + x + y == 0){
                b[i] = '0';
                carry = 0;
            }
        }

        for(int j=i;j<b.size();j++){
            int x = 0;
            int y = (b[j])-'0';

            if(carry + x + y == 3){
                b[j] = '1';
                carry = 1;
            }
            else if(carry + x + y == 2){
                b[j] = '0';
                carry = 1;
            }
            else if(carry + x + y == 1){
                carry = 0;
                b[j] = '1';
            }
            else if(carry + x + y == 0){
                b[j] = '0';
                carry = 0;
            }
        }

        if(carry == 1){
            b.push_back('1');
        }

        reverse(b.begin(),b.end());
        return b;
    }
};
// @lc code=end