store/works/solutions/leetcode/cpp/371.cpp


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

class Solution {
public:
  int getSum(int a, int b) {
    unsigned x = a, y = b;

    unsigned carry = 0;

    unsigned result = 0;

    for (int i = 0; i < sizeof(int) * 8; i++) {
      unsigned mask = 1 << i;

      unsigned n = x & mask ? 1 : 0, m = y & mask ? 1 : 0;

      if (n ^ m ^ carry) {
        result |= mask;
      }

      carry = n & m || n & carry || m & carry;
    }

    return static_cast<int>(result);
  }
};