【LeetCode】371. Sum of Two Integers

问题描述

问题链接：https://leetcode.com/problems/sum-of-two-integers/#/description

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.

我的代码

public class Solution {
    public int getSum(int a, int b) {
        /*
        没啥思路，从讨论区抄的。来个例子。

        3 + 5

        0011 0101

        3 ^ 5 = 0110 = 6
        (3 & 5) << 1 = 0001 << 1 = 0010 = 2

        6 ^ 2 = 0110 ^ 0010 = 0100 = 4
        (6 & 2) << 1 = 0010 << 1 = 0100 = 4

        4 ^ 4 = 0
        (4 & 4) << 1 = 0100 << 1 = 1000 = 8

        0 ^ 8 = 1000 = 8
        (1 & 8) << 1 = 0
        */
        return b == 0 ? a : getSum(a ^ b,(a & b) << 1);
    }
}

讨论区

Java simple easy understand solution with explanation

链接地址：https://discuss.leetcode.com/topic/49771/java-simple-easy-understand-solution-with-explanation

位操作讲得很到位。

I have been confused about bit manipulation for a very long time. So I decide to do a summary about it here.

“&” AND operation, for example, 2 (0010) & 7 (0111) => 2 (0010)

“^” XOR operation, for example, 2 (0010) ^ 7 (0111) => 5 (0101)

“~” NOT operation, for example, ~2(0010) => -3 (1101) what??? Don’t get frustrated here. It’s called two’s complement.

1111 is -1, in two’s complement

1110 is -2, which is ~2 + 1, ~0010 => 1101, 1101 + 1 = 1110 => 2

1101 is -3, which is ~3 + 1

so if you want to get a negative number, you can simply do ~x + 1

Reference:

https://en.wikipedia.org/wiki/Two%27s_complement

https://www.cs.cornell.edu/~tomf/notes/cps104/twoscomp.html

For this, problem, for example, we have a = 1, b = 3,

In bit representation, a = 0001, b = 0011,

First, we can use “and”(“&”) operation between a and b to find a carry.

carry = a & b, then carry = 0001

Second, we can use “xor” (“^”) operation between a and b to find the different bit, and assign it to a,

Then, we shift carry one position left and assign it to b, b = 0010.

Iterate until there is no carry (or b == 0)

// Iterative
public int getSum(int a, int b) {
    if (a == 0) return b;
    if (b == 0) return a;

    while (b != 0) {
        int carry = a & b;
        a = a ^ b;
        b = carry << 1;
    }

    return a;
}

// Iterative
public int getSubtract(int a, int b) {
    while (b != 0) {
        int borrow = (~a) & b;
        a = a ^ b;
        b = borrow << 1;
    }

    return a;
}

// Recursive
public int getSum(int a, int b) {
    return (b == 0) ? a : getSum(a ^ b, (a & b) << 1);
}

// Recursive
public int getSubtract(int a, int b) {
    return (b == 0) ? a : getSubtract(a ^ b, (~a & b) << 1);
}

// Get negative number
public int negate(int x) {
    return ~x + 1;
}