当前位置：网站首页>Bit operation in leetcode

Bit operation in leetcode

2022-06-11 22:22:00 【Donkey of the production team】

Bit operation classification

Logical bit operators

be located &

Only two are for 1
Only then 1
Insert picture description here

position or |

Just one for 1
for 1

Insert picture description here

Exclusive or ^

Only different Only then 1,
otherwise by 0.
Insert picture description here

According to the not

Insert picture description here

Displacement operators

Move left <<

A shift to the left can be seen as This number ride 2 了
Insert picture description here

Move right >>

A shift to the left can be seen as This number except 2 了
But notice If This number Positive number , Left complement 0
If This number It's a negative number , Left complement 1.

Insert picture description here

actual combat leetcode

https://leetcode.cn/problems/add-two-integers/

2235 Sum of two numbers

Code

class Solution{
    
    public int sum (int num1, int num2){
    
        
        if (num2 == 0){
    
            return num1;
        }
        int add_xor = num1 ^ num2; // sum result without carry
        int add_carry = (num1 & num2) << 1; // summ reult only about carry

        return sum(add_xor,add_carry);
    }
}