[LeetCode] 371.Sum of Two Integers

[LeetCode] 371.Sum of Two Integers

• 题目描述
• 解题思路
• 实验代码

---

题目描述

Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.

Example:
Given a = 1 and b = 2, return 3.

解题思路

这道题目考察的就是位运算实现加法，首先a与b做异或运算，当a与b都为1时进位，即左移一位。之后做递归运算就能得到结果。

实验代码

class Solution {
public:
    int getSum(int a, int b) {
        int m = a ^ b, n = (a & b) << 1;
        if (n != 0) return getSum(m, n);
        return m;
    }
};