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.
We can see the answer from zhaolz, whose idea is excellent.
We can implement the +, -, * using Bitwise operator.
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;
}
If we want to get a better understanding of substract
Let’s see the code below!
public static int getSubtract(int a, int b) {
if(a == 0) return (~b + 1);
if(b == 0) return a;
int borrow = 0;
while(b != 0) {
borrow = (~a) & b;
a = a ^ b;
b = borrow << 1;
}
return a;
}
Well now let’s see the multiplication!
public int getProduct(int a, int b) {
if (a==0 || b==0) return 0;
int result = 0;
while (b != 0) {
if ((b & 1) != 0) {
result = getSum(a,result);
}
a <<= 1;
b >>>= 1;
}
return result;
}