Addition without addition, subtraction, multiplication and division (simple difficulty)

Title Overview ( Simple difficulty )

Topic link ：
Point me into the leetcode

Ideas and code

Train of thought display

We still choose to look at the solution of this topic , I have carefully selected the following solutions , You can watch it directly :
This solution is the best one I think
The solution of this problem is also good
Now let's talk about binary addition
Click me to enter the blog
One thing to note is that binary addition is full 2 Into the 1, Then full 2 The number subtracted from the digit of is 2, Not at all 1.

You can see my blog about shift operators ：
Click me to enter the blog
You can also see the introduction of this topic ：
Click to enter the solution

Code example

class Solution {
    
    public int add(int a, int b) {
    

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