> For the complete documentation index, see [llms.txt](https://dfine.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://dfine.gitbook.io/leetcode/371.sum_of_two_integers.md).

# 371.Sum of Two Integers

**371.Sum of Two Integers**

难度:Easy

> 不使用运算符 + 和 - ​​​​​​​，计算两整数 ​​​​​​​a 、b ​​​​​​​之和。

```
示例 1:

输入: a = 1, b = 2
输出: 3
示例 2:

输入: a = -2, b = 3
输出: 1
```

位运算，需要注意负数情况，有符号数左移溢出会报错。

```
class Solution {
public:
    int getSum(int a, int b) {
        while (b) {
            auto c = ((unsigned int)a & b) << 1; // 防止 AddressSanitizer 对有符号左移的溢出保护处理
            a = a ^ b;
            b = c;
        }
        return a;
    }
};
```

> 执行用时 : 4 ms, 在Sum of Two Integers的C++提交中击败了95.58% 的用户\
> 内存消耗 : 8.4 MB, 在Sum of Two Integers的C++提交中击败了5.01% 的用户